#include<bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
void solveTS() {
    int n; cin>>n;
    vector<pii> v(n);
    vector<int> nums;
    for(int i=0; i<n; i++) {
        cin>>v[i].first>>v[i].second;
        nums.push_back(v[i].first);
        nums.push_back(v[i].second);
    }

    sort(nums.begin(),nums.end());
    nums.erase(unique(nums.begin(),nums.end()),nums.end());
    
    int mid_id;

    for(int i=nums.size()-1; i>=0; i--){
        mid_id=i;
        int mid=nums[mid_id];

        int cnt_1=0;
        for(auto [x,y]:v)
            if(x>=mid) cnt_1++;

        int cnt_2=0,maxx=0;
        for(auto [x,y]:v) {
            int type=0;

            if(x<mid&&y>=mid) type=1;
            else if(x>=mid&&y<mid) type=-1;
            cnt_2+=type;
            if(cnt_2>maxx) maxx=cnt_2;
            if(cnt_2<0) cnt_2=0;
        }

        if(cnt_1+maxx>=n/2+1) break;

    }
    cout<<nums[mid_id];
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solveTS();
}
/*
5
3 6
5 2
4 7
6 4
2 8

 */