#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define SZ(s) (int)(s.size())
#define gen(arr,n)  generate(arr,arr+n,nxt)
#define all(v) v.begin(),v.end()
#define Blobo2 ios_base::sync_with_stdio(false);cin.tie(NULL);

const int mod = 1e9+7;
int32_t nxt(){int32_t x;cin>>x;return x;}

void testCase(){
   int n=nxt();
   int a[n],b[n];
   for(int i=0;i<n;i++)
        a[i] = nxt(), b[i] = nxt();
    int s=1,e=1e9;
    while(s<=e){
        int mid = (s+e)/2;
        int ok[n];
        for(int i=0;i<n;i++){
            if(a[i] >= mid && b[i] < mid)
                ok[i] = -1;
            else if(a[i] < mid && b[i] < mid)
                ok[i] = 0;
            else ok[i] = 1;
        }
        int mx = 0, sum = 0, start = 0, end = 0, S = 0;
        for(int i=0;i<n;i++){
            sum += ok[i];
            if(mx < sum){
                mx = sum;
                start = S;
                end = i;
            }
            if(sum < 0){
                sum = 0;
                S = i + 1;
            }
        }
        if(!mx) start = end = n;
        int cnt = 0;
        for(int i=0;i<start;i++)
            cnt += (a[i] >= mid);
        for(int i=end+1;i<n;i++)
            cnt += (a[i] >= mid);
        cnt += mx;
        if(cnt >= n/2+1)
            s = mid + 1;
        else e = mid - 1;
    }
    cout<<e<<endl;
}

signed main() {
    #ifndef ONLINE_JUDGE
        freopen("in1.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #endif
    Blobo2
    int qu=1;
    for(int i=0;i<qu;i++){
        testCase();
    }
    return 0;
}