#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
const int N = 515;
vector <int> g[N], vertices, islands;
void dfs (int u, int p) {
vertices.push_back(u);
for (int v: g[u]) {
if (v == p) continue;
dfs(v, u);
}
}
int findEgg(int N, vector<pair<int, int> > bridges) {
int L = 1, R = N;
for (int i = 1; i <= N; i++) g[i].clear();
for (auto i: bridges) {
g[i.first].push_back(i.second);
g[i.second].push_back(i.first);
}
vertices.clear();
dfs(1, 1);
while(L < R) {
int M = (L + R)/2;
islands.clear();
for (int i = 1; i <= M; i++) islands.push_back(vertices[i - 1]);
if(query(islands)) R = M;
else L = M+1;
}
return vertices[R - 1];
}
