#include<bits/stdc++.h>
using namespace std;
#include "grader.h"
// define
#define execute cerr << " Time: " << fixed << setprecision(6) << (1.0 * clock() / CLOCKS_PER_SEC) << "s\n";
#define ll long long
#define ii pair <int , int>
#define iii pair <int , ii>
#define se second
#define fi first
#define all(v) (v).begin() , (v).end()
#define Unique(v) sort(all(v)) , v.resize(unique(all(v)) - v.begin())
#define bit(x,i) (((x) >> (i)) & 1LL)
#define flip(x,i) ((x) ^ (1LL << (i)))
#define ms(d,x) memset(d , x , sizeof(d))
#define exist __exist
#define ends __ends
#define visit visited
#define left __left
#define right __right
#define sitingfake 1
#define orz 1
// constant
const long long mod = 1e9 + 7;
const long long linf = 4557430888798830399LL;
const long long nlinf = -4485090715960753727LL;
const int inf = 1061109567;
const int ninf = -1044266559;
const int dx[] = {0 , -1 , 0 , 1};
const int dy[] = {-1 , 0 , 1 , 0};
template<typename T> bool maximize(T &a, const T &b) {
if(a < b) {a = b; return 1;}
return 0;
}
template<typename T> bool minimize(T &a, const T &b) {
if(a > b) {a = b; return 1;}
return 0;
}
void Plus(ll & a ,ll b) {
if(b >= 2 * mod) b %= mod;
if(b >= mod) b -= mod;
a += b;
if(a >= mod) a -= mod;
}
void Mul(ll & a, ll b) {
(a *= (b % mod)) %= mod;
}
// code
const int maxn = 550;
vector <int> adj[maxn];
int visit[maxn] , timer = 0;
int n;
void dfs(int u , int p){
visit[++timer] = u;
for(int v : adj[u]){
if(v != p){
dfs(v , u);
}
}
}
bool check(int mid){
vector <int> tmp;
for(int i = 1; i <= mid; i++) tmp.push_back(visit[i]);
return query(tmp);
}
int findEgg(int N , vector <ii> bridges){
for(int i = 1; i <= n; i++) adj[i].clear() , visit[i] = 0;
n = N;
timer = 0;
for(ii it : bridges){
adj[it.fi].push_back(it.se);
adj[it.se].push_back(it.fi);
}
dfs(1 , -1);
int left = 1 , right = n;
while(right - left > 0){
int mid = (r + l) >> 1;
if(check(mid)) right = mid;
else left = mid + 1;
}
return visit[right];
}
// signed main() {
// ios_base::sync_with_stdio(0);
// cin.tie(0);
// cout.tie(0);
// #ifndef ONLINE_JUDGE
// #define task "task"
// freopen(task".inp", "r", stdin);
// freopen(task".out", "w", stdout);
// #endif
// int tc = 1;
// // cin >> tc;
// //while(tc--) solve();
// execute;
// }
