#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define sz(x) (int) (x).size()
const int mxN = 520;
vector<int> adj[mxN];
vector<int> ord;
void dfs(int node, int p){
ord.pb(node);
for (int c : adj[node]){
if (c != p) dfs(c,node);
}
}
int findEgg(int N, vector<pair<int,int>> bridges){
for (int i = 0; i <= N; i++) adj[i].clear();
ord.clear();
for (pair<int, int> i : bridges) {
adj[i.f].pb(i.s);
adj[i.s].pb(i.f);
}
dfs(1,0);
int l = -1;
int r = N-1;
int cur;
while (r-l>1){
cur = (l+r)/2;
if (query(vector<int>(ord.begin(),ord.begin()+cur+1))) r = cur;
else l = cur;
}
return ord[r];
}
