#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int> g;
int findEgg (int N, vector < pair < int, int > > bridges)
{
sort(bridges.begin(),bridges.end());
int l=1,r=bridges.size();
while(l<r){
int mid=(l+r)/2;
g.clear();
for(int i=0;i<mid;i++){
g.push_back({bridges[i].first});
g.push_back({bridges[i].second});
}
sort(g.begin(),g.end());
g.erase(unique(g.begin(),g.end()),g.end());
if(query(g))r=mid;
else l=mid+1;
}
if(query({bridges[l-1].first}))return bridges[l-1].first;
else return bridges[l-1].second;
}
