#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
const int N = 515;
vector <int> g[N], vertices;
int n, a[N];
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) {
n = N;
vertices.clear();
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);
}
dfs(1, 1);
int l = 1;
int r = n;
vector <int> islands;
while (l < r) {
int mid = (l + r) / 2;
islands.clear();
for (int i = 1; i <= mid; i++) {
islands.push_back(vertices[i - 1]);
}
if (query(islands)) r = mid;
else l = mid + 1;
}
return vertices[r - 1];
}
