#include <bits/stdc++.h>
#include "grader.h"
//#include "grader.cpp"
using namespace std;
vector<int> adj[520];
vector<int> vec;
void dfs(int node,int p){
vec.push_back(node);
for(auto child: adj[node]){
if(child!=p)
dfs(child,node);
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(pair<int,int> i: bridges){
adj[i.first].push_back(i.second);
adj[i.second].push_back(i.first);
}
int l=1,r=N-1,ans=1;
while(l<=r){
int mid=(l+r)/2;
if(query(vector<int>(vec.begin(), vec.begin()+mid) ) ){
ans=mid;
r=mid-1;
}
else{
l=mid+1;
}
}
return ans;
}
