//*** Bismillah ***//
// #pragma GCC optimize("O3", "fast-math", "unroll-loops", "no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
// #if !defined(ONLINE_JUDGE) and !defined(EVAL)
// #include "template/debug.h"
// #else
// #define d(x...)
// #endif
#define fr first
#define er erase
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define ull unsigned ll
#define vpll vector<pll>
#define len(x) (ll) x.size()
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll maxn = 600+5;
ll n,m,k=0;
#include "grader.h"
vector<int> st;
vll g[maxn];
void sapsup(ll u, ll p = -1){
st.pb(u);
for(auto v : g[u]){
if(v == p) continue;
sapsup(v, u);
}
}
int findEgg(int _n, vector<pair<int, int>>_g){
n = _n;
for(ll i = 1; i <= n; i ++){
g[i].clear();
}
for(auto [x, y] : _g){
g[x].pb(y);
g[y].pb(x);
}
st.clear();
sapsup(1);
ll l = 1, r = len(st) - 1, cv = 1, f = 0;
while(l <= r){
ll md = (l + r) >> 1;
vector<int> qr;
for(ll i = 0; i <= md; i ++){
qr.pb(st[i]);
}
if(query(qr)){
r = md - 1;
cv = qr[md];
}
else{
f = 1;
l = md + 1;
}
}
if(!f) return 1;
return cv;
}
// void _(ll &tt){
// }
// signed main() {
// ll tm = clock();
// cin.tie(0)->sync_with_stdio(0);
// ll t = 1;
// cin >> t;
// for(ll tt = 1; tt <= t; tt ++) {
// _(tt);
// }
// cerr << "\n\033[1;31mTime: \033[1;30m" \
// << (double)(clock()-tm)/1000000 << "\033[1;32m seconds\n";
//
