#include "prize.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll l,r,c,ma,b[1010101];
vector<int> v;
vector<int> d[1010101];
int find_best(int n) {
for(int i = 0; i < n; i++) {
std::vector<int> res ;
if(b[i]==0)
{
b[i]=1;
res=ask(i);
d[i]=res;
}
else
res=d[i];
if(res[0] + res[1] == 0)
return i;
ma=max((ll)ma,(ll)(res[0]+res[1]));
if(res[0]+res[1]!=ma)
continue;
l=i+1;
r=n-1;
while(l<=r)
{
c=(l+r)/2;
if(b[c]==0)
{
b[c]=1;
v=ask(c);
d[c]=v;
}
else
v=d[c];
if(v[0]==res[0]&&v[1]==res[1])
{
i=c;
l=c+1;
}
else
r=c-1;
}
}
return 0;
}
