#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) (x).begin(),(x).end()
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;
int find_best(int n) {
if(n<=5000){
REP(i,0,n){
vi a=ask(i);
if(a[0]==0&&a[1]==0)return i;
}
}
int mx=0;
REP(i,0,450){
vi a=ask(i);
mx=max(mx,a[0]+a[1]);
if(a[0]+a[1]==0)return i;
}
int pos=450;
while(pos<n){
bool flag=1;
while(pos<n&&flag){
vi a=ask(pos);
if(a[0]+a[1]==0)return pos;
if(a[0]+a[1]!=mx)pos++;
else flag=0;
}
int l=pos+1,r=n;
vi b=ask(pos);
while(l!=r){
int m=(l+r)/2;
vi a=ask(m);
if(a[0]+a[1]==0)return m;
if(b[1]==a[1])l=m+1;
else r=m;
}
pos=l;
}
return n-1;
}
