#include<bits/stdc++.h>
#include"grader.h"
using namespace std;
int parent[20],rang[20];
/*void make_set(int x)
{
parent[x]=x;
rang[x]=1;
}
int find_set(int x)
{
if(parent[x]==x)
{
return x;
}
return find_set(parent[x]);
}
void union_set(int x,int y)
{
if(x!=y)
{
x=find_set(x);
y=find_set(y);
if(rang[x]<rang[y])
{
swap(x,y);
}
parent[y]=x;
rang[x]+=rang[y];
}
}*/
int findEgg(int n, vector < pair < int, int > > bridges)
{
for(int i=1;i<n;i++)
{
vector<int> islands;
islands.push_back(bridges[i].first);
islands.push_back(bridges[i].second);
if(query(islands)==1)
{
vector<int> v,v1;
v.push_back(bridges[i].first);
v1.push_back(bridges[i].second);
if(query(v)==1)
{
return v[0];
}
else
{
return v1[0];
}
}
}
return n;
}
