#include "prize.h"
#include <bits/stdc++.h>
#define forn(i,a,b) for(int i = a; i<b; i++)
using namespace std;
typedef long long ll;
ll cnt = 0;
vector<int> aask(int i ){
cnt++;
/* while(cnt>9990){
exit(0);
}*/
//cout<<cnt<<'\n';
return ask(i);
}
int find_best(int n) {
ll i = 0;
vector<int> ares = {-1,-1};
vector<int> last = {-1,-1};
forn(i,0,min(473,n)){
vector<int> res = aask(i);
if(res[0]+res[1]>last[0]+last[1]) last=res;
}
ll rng = 0;
forn(j,0,392){
i=j*(512);
ll nmax = min(n,j*512+512);
ares={-1,-1};
while(i<nmax){
vector<int> ires = ares;
ires=aask(i);
if(ires[0]==0 && ires[1]==0) return i;
if(ires[0]+ires[1]!=last[0]+last[1]){
i++;
continue;
}
rng++;
ll l = i; ll r=nmax-1;
vector<int> rv = aask(r);
if(rv[0]==ires[0] && rv[0]+rv[1]==ires[0]+ires[1]){ i=r+1; ares={-1,-1}; continue;}
while(l<=r){
ll mid=(l+r)/2;
vector<int> res = aask(mid);
ares=res;
//cout<<res[1]<<" <-"<<mid<<'\n';
if(res[1]<ires[1]||res[1]+res[0]!=ires[1]+ires[0]) r=mid-1;
else l=mid+1;
}
i=r+1;
//cout<<"rango "<<rng<<'\n';
}
if(nmax==n) break;
}
while(true){
cout<<"salio\n";
}
return 0;
}
