#include<bits/stdc++.h>
#include"grader.h"
#define exoworldgd cin.tie(0)->sync_with_stdio(0),cout.tie(0)
#define ll long long
using namespace std;
const int N=555;
vector<int>g[N],v;
void dfs(int u,int p){
v.push_back(u);
for(int x:g[u])if(x^p)dfs(x,u);
}
int findEgg(int n,vector<pair<int,int>>e){
for(int i=1;i<=n;i++)g[i].clear();
for(auto[a,b]:e)g[a].push_back(b),g[b].push_back(a);
v.clear(),dfs(1,1);
int l=0,r=v.size()-1;
while(l<r){
int m=l+r>>1;
vector<int>q;
for(int i=0;i<=m;i++)q.push_back(v[i]);
query(q)?r=m:l=m+1;
}
return v[l];
}
