// ~ Be Name Khoda ~ //
#include "prize.h"
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define fi first
#define se second
const int maxn = 1e6 + 10;
const int maxn5 = 5e5 + 10;
const int maxnt = 1.2e6 + 10;
const int maxn3 = 1e3 + 10;
const int mod = 1e9 + 7;
const ll inf = 1e18;
pair <int, int> ans[maxn5];
vector <int> av;
bool done[maxn5];
pair <int, int> assk(int id){
if(!done[id]){
vector <int> x = ask(id);
done[id] = true;
ans[id].fi = x[0];
ans[id].se = x[1];
}
auto ret = ans[id];
for(auto u : av){
if(u < id && ans[u].fi + ans[u].se < ans[id].fi + ans[id].se)
ret.fi--;
if(u > id && ans[u].fi + ans[u].se < ans[id].fi + ans[id].se)
ret.se--;
}
return ret;
}
int find_best(int n) {
while(true){
int l = 0, r = n; // [l, r)
while(r - l > 1){
int mid = (l + r) >> 1;
pair <int, int> ans = assk(mid);
if(ans.fi)
r = mid;
else
l = mid;
}
av.pb(l);
auto ans = assk(l);
if(ans.fi == 0 && ans.se == 0)
return l;
}
}
