#include "prize.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< vector<int>,vector<int> > PVV;
typedef pair< int,PVV > PIVV;
typedef pair< int,PIVV > PIIVV;
typedef pair< int,PIIVV > PIIIVV;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
vector<int> v;
int find_best(int n) {
int bas=0;
int son=n-1;
priority_queue<PIIIVV> q;
vector<int> v1;
v=ask(0);
v1=ask(n-1);
q.push({-(max(v[0],v1[0])+max(v[1],v1[1])),{bas,{son,{v,v1}}}});
while(q.size()){
bas=q.top().se.fi;
son=q.top().se.se.fi;
v=q.top().se.se.se.fi;
v1=q.top().se.se.se.se;
q.pop();
if(v[0]==v1[0] && v[1]==v1[1])continue;
if(bas>son)continue;
vector<int> res=ask(ort);
if(res[0]+res[1]==0)return ort;
q.push({-(max(v[0],res[0])+max(v[1],res[1])),{bas,{ort-1,{v,res}}}});
q.push({-(max(res[0],v1[0])+max(res[1],v1[1])),{ort+1,{son,{res,v1}}}});
}
return son;
}
