CF1000247AJ

#include <algorithm>
#include <bitset>
#include <deque>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define fst first
#define snd second
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset(a, v, sizeof(a))
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define FORN(i,s,n) for(int i=s;i<(int)(n);i++)
#define FOR(i,n) FORN(i,0,n)
#define FORIT(i,x) for( typeof x.begin()  i=x.begin(); i!=x.end(); i++ )
#define trace(x)    cerr << #x << ": " << x << endl;
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl;

using namespace std;

typedef long long int64;
typedef vector <int> vi;
typedef pair <int,int> ii;
typedef vector <string> vs;
typedef vector <ii> vii;

const int INF = 2e9+9;

map <int , int> DP;

int main(){
    int N; cin>>N;
    int a[N],b[N];
    cin>>a[0]>>b[0];
    int auxa,auxb;
    int ans=b[0];
    FORN(i,1,N){
        scanf("%d %d", &auxa, &auxb);
        if ( auxa>a[i-1] ) a[i]=auxa; else a[i]=a[i-1];
        if ( auxb>b[i-1] ) b[i]=auxb; else b[i]=b[i-1];
        if ( a[i]!=a[i-1] ) ans=max(ans,auxb);
    }
    cout<<ans<<endl;
}