#include <bits/stdc++.h>
using namespace std;
int binary_search(int arr[],int low,int high,int item)
{
while(low<=high)
{
int mid=(low+high)/2;
if(arr[mid]==item)
return mid;
if(arr[mid]>item)
{
high=mid-1;
}
else
{
low=mid+1;
}
}
return -1;
}
int main()
{
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IGJpbmFyeV9zZWFyY2goaW50IGFycltdLGludCBsb3csaW50IGhpZ2gsaW50IGl0ZW0pCnsKCXdoaWxlKGxvdzw9aGlnaCkKCXsKCQlpbnQgbWlkPShsb3craGlnaCkvMjsKCQlpZihhcnJbbWlkXT09aXRlbSkKCQkJcmV0dXJuIG1pZDsKCgkJaWYoYXJyW21pZF0+aXRlbSkKCQl7CgkJCWhpZ2g9bWlkLTE7CgkJfQoJCWVsc2UKCQl7CgkJCWxvdz1taWQrMTsKCQl9Cgl9CgoJcmV0dXJuIC0xOwp9CgppbnQgbWFpbigpCnsKCXJldHVybiAwOwp9