#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int> ad[1005];
bool visited[1005];
int findEgg(int n, vector<pair<int, int>> bridges)
{
for(int i = 1; i <= n; i++) ad[i].clear();
for(int i = 0; i < n-1; i++){
int u = bridges[i].first, v = bridges[i].second;
ad[u].push_back(v); ad[v].push_back(u);
}
vector<int> order;
fill(visited+1, visited+n+1, 0);
queue<int> w; w.push(1); visited[1] = 1;
while(w.size() > 0){
int u = w.front(); w.pop(); order.push_back(u);
for(int v : ad[u]) if(visited[v] == 0){
visited[v] = 1;
w.push(v);
}
}
int l = 0, r = n-1, ans = 0;
while(l <= r){
int mid = (l+r)/2;
vector<int> question;
for(int i = l; i <= mid; i++) question.push_back(order[i]);
if(query(question) == 1){
ans = mid; r = mid-1;
}
else l = mid+1;
}
return order[ans];
}
