#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector <int>;
using pii = pair <int, int>;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define N 200005
map < int, vector<int> > query;
int mx;
int fen[N];
void add(int x){
x++;
while (x < N){
fen[x]++;
x += x & -x;
}
}
int sum(int x){
x++;
int s = 0;
while (x){
s += fen[x];
x -= x & -x;
}
return s;
}
vector < int > askk(int x){
if( query.find( x ) == query.end() ){
return query[x] = ask(x);
}
return query[x];
}
int gg(int l, int r){
vi tmp;
if (l > r) return -1;
if (l == r) {
tmp = askk(l);
if (tmp[0] + tmp[1] == 0) return l;
return -1;
}
while(l <= r){
tmp = askk(r);
if (tmp[0] + tmp[1] == 0) return r;
if (tmp[0] + tmp[1] == mx) break;
add(r);
r--;
}
vi tmp1;
while (l <= r){
tmp1 = askk(l);
if (tmp1[0] + tmp1[1] == 0) return l;
if (tmp1[0] + tmp1[1] == mx) break;
add(l);
l++;
}
if (l > r) return -1;
if (tmp[0] == tmp1[0]) return -1;
if (l == r) return gg(l, r);
int mid = (l + r) / 2;
int ind = gg(l , mid);
if (ind != -1) return ind;
else return gg(mid + 1, r - 1);
}
int find_best(int n) {
int s[505];
for (int i = 0;i < 500;i++){
vi ans = askk(i);
s[i] = ans[0] + ans[1];
if (!s[i]) return i;
mx = max(mx, s[i]);
}
for (int i = 0;i * i < n;i++)
if (s[i] != mx)
add(i);
// vi ans = askk(0);
// mx = ans[0] + ans[1];
return gg(500, n - 1);
}
