#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
int node[600];
vector<int> g[600];
int id;
void dfs(int u, int p)
{
node[++id] = u;
for (auto &x : g[u])
{
if (x == p)
{
continue;
}
dfs(x, p);
}
}
bool ask(int m)
{
vector<int> v;
for (int i = 1; i <= m; i++)
v.push_back(node[i]);
return query(v);
}
int findEgg(int N, vector<pair<int, int>> bridges)
{
for(auto&x :bridges){
g[x.first].push_back(x.second);
g[x.second].push_back(x.first);
}
int l=1,r=N;
while(l<r){
int mid =(l+r)>>1;
if(ask(mid))
r =mid;
else
l = mid+1;
}
return l;
}
