#include <bits/stdc++.h>
using namespace std;
int binary_search(const unsigned *a,const int n, unsigned x)
{
register unsigned int l = 0, r = 99999999;
for(;;) {
#define mid ((l + r) >> 1)
if ( a[mid] == x ) return mid;
else if (a[mid] > x ) r = mid - 1;
else l = mid + 1;
}
}
int main() {
return 0;
}