/*
Author: haze
2023/11/8
19:21
*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int (i) = (l); (i) <= (r); ++(i))
#define drep(i, r, l) for(int (i) = (r); (i) >= (l); --(i))
#define ll long long
#define LL __int128
using namespace std;

inline ll read() {
    char ch = getchar();
    ll s = 0;
    bool w = 0;
    while (!isdigit(ch)) {
        if (ch == '-')w = 1;
        ch = getchar();
    }
    while (isdigit(ch))s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
    return w ? -s : s;
}

inline char rc() {
    char ch = getchar();
    while (1) {
        if (ch >= '!' && ch <= '~')return ch;
        ch = getchar();
    }
}

template<class T1, class T2>
T1 min(T1 AA, T2 BB) { return AA > BB ? BB : AA; }

template<class T1, class T2>
T1 max(T1 AA, T2 BB) { return AA < BB ? BB : AA; }

const int itinf = 1e9;
const ll llinf = 4e18;
const int mod = 1000000007;
const int N = 500009;

int main() {
    int n = read();
    vector<array<ll, 2>>a(n);
    irep(i, 0, n - 1){
        int ai = read(), bi = read();
        a[i] = {ai, bi};
    }
    int l = 0, r = 1e9;
    auto check = [&](int x) -> bool{
        int goal = (n + 1) >> 1, cnt = 0;
        vector<int>f;
        for(auto [aa, bb] : a){
            if(aa >= x) ++ cnt;
            bool f1 = aa >= x, f2 = bb >= x;
            if(f1 == f2)f.emplace_back(0);
            else if(f2 == 1)f.emplace_back(1);
            else f.emplace_back(-1);
        }
        irep(i, 1, n - 1)f[i] += f[i - 1];
        ll minval = 0, ans = 0;
        for(int i = 0; i < n; ++ i){
            ans = max(ans, f[i] - minval);
            minval = min(minval, f[i]);
        }
        if(cnt + ans >= goal)return true;
        return false;
    };
    while(l < r){
        int mid = (l + r) >> 1;
        if(check(mid)){
            l = mid;
        }
        else{
            r = mid - 1;
        }
    }
    cout << l;
    return 0;
}
/*
 * 5
3 6
5 2
4 7
6 4
2 8
 */