#include <bits/stdc++.h>
#define NNN 100005
#define ll long long int
#define fo(i,x,y) for(int i=x;i<=y;i++)
#define fs(ar,n) fo(i,1,n) cin>>ar[i]
#define sp " "
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#include "grader.h"
using namespace std;
ll n,m,ar[NNN],sum,t;
int findEgg (int NN, vector < pair < int, int > > bridges)
{
n=NN;
fo(i,1,n-1)
{
if(query({i}))
return i;
}
// if (query ({1})) return 1;
return n;
}
