#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
using ll=long long;
vector<ll>a;
vector<ll>adj[1033];
void dfs(ll v,ll p){
a.push_back(v);
for(ll i=0;i<adj[v].size();i++){
if(adj[v][i]!=p){
dfs(adj[v][i],v);
}
}
}
int findEgg (int n,vector<pair<int,int>>bridges)
{
a.clear();
for(ll i=0;i<1031;i++){
adj[i].clear();
}
for(int i=0;i<n-1;i++){
adj[bridges[i].first].push_back(bridges[i].second);
adj[bridges[i].second].push_back(bridges[i].first);
}
dfs(1,-1);
ll l=0, r=a.size()-1, maks=-1;
while(l<=r){
ll mid=(l+r)/2;
vector<int>v1;
for(ll i=0;i<=mid;i++){
v1.push_back(a[i]);
}
if(query(v1)==0)
{
maks=max(maks,mid);
l=mid+1;
}
else {
r=mid-1;
}
}
return a[maks+1];
}
