#include "prize.h"
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <deque>
#include <map>
#include <chrono>
#include <random>
#include <bitset>
#include <tuple>
#define SZ(x) int(x.size())
#define FR(i,a,b) for(int i=(a);i<(b);++i)
#define FOR(i,n) FR(i,0,n)
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define A first
#define B second
#define mp(a,b) make_pair(a,b)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef unsigned __int128 U128;
typedef __int128 I128;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;
using namespace std;
PII q(int i){
vector<int> tmp=ask(i);
return mp(tmp[0],tmp[1]);
}
const int MAXN=2e5+5;
map<PII,PII> vis;
bool bad[MAXN];
int find_best(int n) {
int mx=0, cheap=0;
FOR(i,min(n,480)){
PII cur=q(i);
vis[cur]=mp(i,i);
int x=cur.A+cur.B;
if (x==0) return i;
if (x>mx){
mx=x;
cheap=i;
}
}
vector<PII> v(n);
FOR(i,n) v[i]=mp(-1,-1);
int i=cheap;
PII qry=q(i);
v[i]=qry;
while(i<n){
int l=i+1, r=n-1, ans=-1;
while (l<=r){
int mid=(l+r)/2;
if (v[mid]==mp(-1,-1)) v[mid]=q(mid);
PII cur=v[mid];
if (vis.count(cur)){
int i1=vis[cur].A, i2=vis[cur].B;
if (mid>i2){
FR(j,i2+1,mid+1) bad[j]=true;
}
if (mid<i1){
FR(j,mid,i1) bad[j]=true;
}
vis[cur].A=min(i1,mid);
vis[cur].B=max(i2,mid);
if (vis[cur].A==mid) r=mid-1;
else l=mid+1;
}
else{
vis[cur]=mp(mid,mid);
if (cur.A+cur.B==0) return mid;
if (cur.A+cur.B<mx || cur.B<qry.B){
ans=mid;
r=mid-1;
}
else l=mid+1;
}
}
i=ans+1;
if (v[i]==mp(-1,-1)) v[i]=q(i);
qry=v[i];
while (i<n && qry.A+qry.B<mx){
if (qry.A+qry.B==0) return i;
i++;
if (!bad[i]){
if (v[i]==mp(-1,-1)) v[i]=q(i);
qry=v[i];
}
}
}
return 0;
}
