#include <iostream>
using namespace std;

int binarySearch(int a[], int n, int x) {
    int mid, left = 0, right = n - 1;
    do {
        mid = (left + right) / 2;
        cout << mid << " " << a[mid] << endl;
        if(x == a[mid]) return mid;
        else
            if(x > a[mid]) left = mid + 1;
            else right = mid - 1;
    } while(left <= right);
    return -1;
}

int main() {
	int a[0];
	int n = 0;
	int x = 32765;
	
	int found = binarySearch(a, n, x);
	if (found == -1)
		cout << "not found" << endl;
	else
		cout << a[found] << endl;
	
	return 0;
}