//
// Created by abc on 23-12-6.
//
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
    int n; cin >> n;
    using P = pair<int, int>;
    vector<P> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i].first >> a[i].second;
    }
    auto c = a;
    sort(c.begin() + 1, c.end());
    int left = c[(n + 1) / 2].first, right = 1e10;
    auto check = [&](int mid) -> bool {
        if (mid <= c[(n + 1) / 2].first) return true;
        vector<int> b(n + 1, 0);
        int ans = 0;
        for (int i = 1; i <= n; i++) {
            if (a[i].first >= mid and a[i].second < mid) b[i] = -1;
            else if (a[i].first < mid and a[i].second >= mid) b[i] = 1;
            else if (a[i].first >= mid and a[i].second >= mid) ans++;
            else if (a[i].first < mid and a[i].second < mid) ans--;
        }
        int res = 0;
        for (int i = 1, cnt = 0; i <= n; i++) {
            cnt = max(0ll, cnt + b[i]);
            res = max(res, cnt);
        }
//        cout << ans + res << "\n";
        return ans + res >= (n & 1);
    };
//    cout << check(2);
    while (left <= right) {
        int mid = left + right >> 1;
        if (check(mid)) left = mid + 1;
        else right = mid - 1;
    }
    cout << right << "\n";
    return 0;
}