#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 3e5+10;


int a[N],b[N],tmp[N<<1],f[N];
int n;

int chk(int x){
    int xi = 0,da = 0;
    for(int i = 1;i<=n;i++){
        if(a[i]<x)xi++;
        else if(a[i]>x)da++;
    }
    if(xi==da && xi==n/2){
        return 1;
    }
    for(int i = 1;i<=n;i++){
        if(a[i]<x && b[i]>x)f[i] = 1;
        else if(a[i]>x && b[i]<x)f[i] = -1;
        else f[i] = 0;
    }
    int l = 0;
    int d = xi - da;
    d/=2;//需要的数字
    map<int,int> mp;
    int now = 0;
    mp[0] = 1;//第零位
    for(int i = 1;i<=n;i++){
        now+=f[i];
        if(mp[now - d])return 1;
        mp[now] = 1;
    }
    return 0;
}


void solve(){
    cin>>n;
    int ind = 0;
    for(int i = 1;i<=n;i++){
        cin>>a[i]>>b[i];
        tmp[++ind] = a[i],tmp[++ind] = b[i];
    }
    if(n==1){
        cout<<max(a[1],b[1])<<'\n';
        return;
    }
    sort(tmp+1,tmp+1+2*n);
    int l = 0,r = n*2+1;
    int ans = 0;
    while(l<r){
        int m = (l+r)/2;
        if(chk(tmp[m])){
            l = m+1;
        }
        else r = m-1;
    }
    if(chk(l))cout<<tmp[l]<<'\n';
    else cout<<tmp[l-1]<<'\n';
}

signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    // cin>>t;
    while(t--)
    solve();
    return 0;
}
/*
5
3 6
5 2
4 7
6 4
2 8

5
1 2
2 3
3 4
4 5
5 6
*/