#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
int n;
vector<int> g[1000];
vector<int> t;
int used[1000];
void dfs(int i) {
used[i]=1;
t.push_back(i);
for(auto x : g[i]) if(!used[x]) dfs(x);
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(auto x : bridges) {
g[x.first].push_back(x.second);
g[x.second].push_back(x.first);
}
dfs(1);
int l = 1, r = N, m;
while(l<r) {
int m = (l+r)/2;
vector<int> z;
for(int i = 1; i <= m; i++) z.push_back(t[i]);
if(query(z)) {
r = m-1;
}
else l=m+1;
}
return l;
}
