#include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
using namespace std;
struct gigel
{
    int x, y;
    bool pt;
};
gigel v[120001], sus, jos ;
int n, i;
int parte( int k )
{
   if () return 1;
   if () return -1;
   return 0;
}
bool cmp( gigel a, gigel b )
{
    if ( a.y < b.y ) return true;
    if ( a.y == b.y ) if( a.x < b.x ) return true;
    return false;
}
int main()
{
    freopen( "infasuratoare.in", "r", stdin);
    freopen( "infasuratoare.out", "w", stdout);
    cin >> n;
    for ( i=1; i<=n; i++ ) { cin >> v[i].x >> v[i].y; }
    sort ( v+1, v+n+1, cmp );
    sus= v[1]; jos = v[n];
    return 0;
}