#include "prize.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< int,int > PII;
#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;
queue<PII> q;
q.push({bas,son});
while(q.size()){
bas=q.front().fi;
son=q.front().se;
q.pop();
if(bas>son)continue;
vector<int> res=ask(ort);
if(res[0]+res[1]==0)return ort;
if(res[0])q.push({bas,ort-1});
else if(res[1]){q.push({ort+1,son});}
}
return son;
}
