#include <bits/stdc++.h>

#define rep(i,s,n) for(int i = int(s); i < int(n); i++)
#define rrep(i,s,n) for(int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(), (v).end()

using ll = long long;
using ull = unsigned long long;
using ld = long double;

template<class T>
bool chmin(T &a, T b) {
    if(a <= b) return false;
    a = b;
    return true;
}

template<class T>
bool chmax(T &a, T b) {
    if(a >= b) return false;
    a = b;
    return true;
}

using namespace std;
const int iinf = 1'000'00'010;

int main() {
    int n; cin >> n;
    vector<int> a(n), b(n);
    rep(i,0,n) cin >> a[i] >> b[i];
    int le = 1, ri = iinf;
    while (ri - le > 1){
        int md = (le + ri) / 2;
        vector<int> p(n,0);
        rep(i,0,n){
            if (a[i] >= md) p[i]--;
            if (b[i] >= md) p[i]++;
        }
        vector<int> dp(n+1,-iinf);
        int ans = 0;
        rep(i,0,n){
            chmax(dp[i+1],p[i]);
            chmax(dp[i+1],p[i]+dp[i]);
            chmax(ans,dp[i+1]);
        }
        rep(i,0,n) if (a[i] >= md) ans++;
        if (ans >= (n/2+1)) le = md;
        else ri = md;
    }
    cout << le << endl;
}