#include "prize.h"
#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
using ll=long long;
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>;
long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)
int find_best(int n) {
vector<int> ans;
vector<int> v(2, 0);
ll x = -1;
FOR(i,n,max(0, n-800)) {
vector<int> res = ask(i);
if(res[0] + res[1] > v[0] + v[1]) v = res, x = i;
}
FOR(i,x+1,n-1) ans.eb(i);
ll bad = n - v[0] - v[1];
while(v[0]) {
ll st=0, en=x;
while(en-st>1) {
ll mid=(st+en)>>1;
vector<int> res = ask(mid);
if(n - res[0] - res[1] != bad) {
en = mid;
continue;
}
if(res[0] < v[0]) st = mid;
else en = mid;
}
vector<int> res = ask(st);
if(n - res[0] - res[1] != bad) {
assert(st == 0);
ans.eb(st);
break;
}
x = st, v = res;
}
for(auto i:ans) {
vector<int> res = ask(i);
if(res[0] == 0 && res[1] == 0) return i;
}
assert(0);
}
