#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
int n;
vector<int> g[600];
int egg = 1;
int used[600];
int used1[600];
vector<int> bfs(int x) {
memset(used, 0, n+1);
used[x]=1;
queue<int> q;
q.push(x);
vector<int> ans;
ans.push_back(x);
while(!q.empty()) {
int c = q.front(); q.pop();
for(int nb : g[c]) {
if(!used[nb]) {
used[nb] = 1;
q.push(nb);
ans.push_back(nb);
}
}
}
return ans;
}
void solve(int curr) {
egg = curr;
used1[curr] = 1;
//cout << curr << endl;
if(g[curr].size()==0 && query({curr})) {
egg = curr;
return;
}
for(int x : g[curr]) {
if(used1[x]) continue;
bool is = query(bfs(x));
if(is) solve(x);
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
//if (query ({1})) return 1;
//return N;
for(auto x : bridges) {
g[x.first].push_back(x.second);
//g[x.second].push_back(x.first);
}
solve(1);
for(int i = 0; i < 600; i++) g[i].clear();
for(int i = 0; i < 600; i++) {
used[i]=0;
used1[i]=0;
}
return egg;
}
