#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rng(1012);
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define gg exit(0);
#include "prize.h"
const int N=200010;
int n;
vector<int> dd[N];
vector<int> qry(int i){
return dd[i].size() ? dd[i] : dd[i]=ask(i-1);
}
int same(int i,int j){
auto x=qry(i), y=qry(j);
return x[0]+x[1]==y[0]+y[1];
}
int cnt(int i,int j){
if(i>j) swap(i,j);
auto x=qry(i), y=qry(j);
return y[0]-x[0];
}
int solve(int l){
int i=l, sz=0;
vector<int> val;
while(i<n){
int le=i+1,mi,ri=n;
while(le<=ri){
mi=(le+ri)/2;
if(same(l,mi) && cnt(l,mi)==sz) i=mi,le=mi+1; else ri=mi-1;
}
if(i==n) break;
auto a=qry(++i);
if(a[0]+a[1]==0) return i-1;
sz++;
}
i=l; int piv=sz;
while(i>1){
int le=1,mi,ri=i-1;
while(le<=ri){
mi=(le+ri)/2;
if(same(l,mi) && cnt(l,mi)==sz-piv) i=mi,ri=mi-1; else le=mi+1;
}
if(i==1) break;
auto a=qry(--i);
if(a[0]+a[1]==0) return i-1;
sz++;
}
return -1;
}
int find_best(int nn){
n=nn;
int x,tmp=-1;
forinc(t,1,10){
int i=rnd(1,n);
auto a=qry(i);
if(tmp<a[0]+a[1]){
tmp=a[0]+a[1];
x=i;
}
}
if(tmp==1){
int le=0,mi,ri=n-1;
while(le<=ri){
mi=(le+ri)/2;
auto a=qry(mi+1);
if(a[0]+a[1]==0) return mi;
if(a[0]) ri=mi-1; else le=mi+1;
}
} else
return solve(x);
}
