#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;
inline void bin(int bas,int son,vector<int> vv,vector<int> vv1){
if(bas>son)return;
if(vv[0]==vv1[0] && vv1[1]==vv[1])return ;
vector<int> res=ask(ort);
if(res[0]+res[1]==0){flag=ort;return ;}
bin(bas,ort-1,vv,res);
bin(ort+1,son,res,vv1);
}
int find_best(int n) {
vector<int> bir,iki;
bir=ask(0);
iki=ask(n-1);
bin(0,n-1,bir,iki);
return flag;
}
