#include <bits/stdc++.h>
#define f first
#define s second
#define ent '\n'
typedef long long ll;
using namespace std;
struct asd{
int a, b, w, ca, cb;
};
vector<int> ask(int i);
const string out[2]={"NO\n","YES\n"};
const ll dx[]={0,1,0,-1,-1,1,1,-1};
const ll dy[]={1,0,-1,0,-1,1,-1,1};
const int mod=998244353;
const int md=1e9+7;
const int mx=2e5+12;
const bool T=0;
vector<int> ans[mx];
int ma;
vector<int> Ask(int i){
if(ans[i].size()>0){
return ans[i];
}
ans[i]=ask(i);
return ans[i];
}
int find(int l,int r,int x,int left,int right){
if(!x || l>r)return -1;
int mid=l+r>>1, cnt=0;
for(int x=0;mid-x>=l || mid+x<=r;x++){
if(mid+x<=r){
auto a=Ask(mid+x);
if(a[0]+a[1]==ma){
int val=find(mid+x+1, r, a[1]-right, a[0], right);
if(val!=-1)return val;
val=find(l, mid - x - (x==0), a[0] - cnt - left, left, a[1] + cnt);
return val;
}
if(a[0]+a[1]==0){
return mid+x;
}
cnt++;
}
if(mid-x>=l){
auto a=Ask(mid-x);
if(a[0]+a[1]==ma){
int val=find(l, mid-x-1, a[0]-left, left, a[1]);
if(val!=-1)return val;
val=find(mid+x+1, r, a[1] - cnt - right, a[0] + cnt, right);
return val;
}
if(a[0]+a[1]==0){
return mid-x;
}
cnt++;
}
}
return -1;
}
int find_best(int n){
int pos=0, c=0;
for(int i=0;i<490;i++){
auto a=Ask(i);
if(a[0]+a[1]==0){
return i;
}
if(a[0]+a[1]>ma){
ma=a[0]+a[1];
}
}
for(int i=0;i<490;i++){
auto a=Ask(i);
if(a[0]+a[1]!=ma){
c++;
}
}
return find(490, n-1, ma - c, c, 0);
}
