#include<bits/stdc++.h>
#define endl '\n'
#define ull unsigned long long int
#include "grader.h"
// vnimavai za otricatelni
using namespace std;
const int maxn = 600;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
bool used[maxn];
int order[maxn], curr = 0;
vector<int> v[maxn], q;
void dfs(int beg)
{
used[beg] = true;
order[++curr] = beg;
for(int nb : v[beg])
{
if(!used[nb])
dfs(nb);
}
}
int findEgg(int n, vector<pair<int, int>> bridges)
{
memset(used, false, sizeof(used));
for(int i = 0; i < n; i++)
v[i].clear();
for(int i = 0; i < bridges.size(); ++i)
{
v[bridges[i].first].push_back(bridges[i].second);
v[bridges[i].second].push_back(bridges[i].first);
}
dfs(1);
int l = 1, r = n;
while(r - l >= 0)
{
q.clear();
int mid = l + (r - l)/2;
for(int i = 1; i <= mid; i++)
q.push_back(order[i]);
if(query(q) == 1)
r = mid - 1;
else
l = mid + 1;
}
return order[r];
}
