#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;
bool good[MAXN];
int find_best(int n) {
int mx=0, cheap=0, mxr=0;
vector<PII> v(n);
FOR(i,n) v[i]=mp(-1,-1);
FOR(i,1){
PII cur=q(i);
v[i]=cur;
int x=cur.A+cur.B;
if (x==0) return i;
if (x>mx){
mx=x;
mxr=cur.B;
cheap=i;
}
}
int i=cheap;
PII qry=v[i];
while(i<n){
int l=i, r=min(n-1, i+256);
if (v[r]==mp(-1,-1)) v[r]=q(r);
PII cur=v[r];
if (cur.A+cur.B==0) return r;
if (cur.A+cur.B==mx && cur.B==mxr){
l=r;
i=r;
continue;
}
if (cur.A+cur.B<mx){
good[r]=true;
r++;
}
while (l<r){
int mid=(l+r+1)/2;
if (v[mid]==mp(-1,-1)) v[mid]=q(mid);
cur=v[mid];
if (cur.A+cur.B==0) return mid;
if (cur.A+cur.B<mx) good[mid]=true;
if (cur.A+cur.B<mx || cur.B<qry.B) r=mid-1;
else l=mid;
}
i=l+1;
while (i<n){
if (good[i]){
i++;
continue;
}
if (v[i]==mp(-1,-1)) v[i]=q(i);
qry=v[i];
if (qry.A+qry.B==0) return i;
if (mx<=qry.A+qry.B){
mx=qry.A+qry.B;
mxr=qry.B;
break;
}
i++;
}
}
return 0;
}
