#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second
int n;
int query(int l, int r, int pl, int pr) {
int ml = (l+r)/2 - 1, mr = ml + 1, pml = -1, pmr = -1;
while(mr <= r) {
vi rsp = ask(mr);
if(2*(rsp[0] + rsp[1]) > n) {
pml = rsp[0] - (mr - ml - 1);
pmr = rsp[0];
mr++;
break;
}
if(rsp[0] + rsp[1] == 0) return mr;
mr++;
}
int ret = -1;
if(pl < pml and l <= ml) ret = query(l, ml, pl, pml);
if(pmr < pr and mr <= r and ret == -1) ret = query(mr, r, pmr, pr);
return ret;
}
int find_best(int N) {
n = N;
while(N--) {
vi rsp = ask(N);
if(2*(rsp[0] + rsp[1]) > n)
return query(0, N-1, 0, rsp[0]);
if(rsp[0] + rsp[1] == 0) return N;
}
return -1;
}
