#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 P = 998244353;
void solve() {
    int n;
    cin >> n;
    vector<pair<int, int>> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i].first >> a[i].second;
    }
    auto check = [&](int x) -> bool {
        vector<int> b(n + 1);
        i64 ans = 0;
        for (int i = 1; i <= n; i++) {
            if (a[i].first >= x) ans++;
            if (a[i].first >= x && a[i].second < x) b[i] = -1;
            else if (a[i].first < x && a[i].second >= x) b[i] = 1;
        }
        vector<array<int, 2>> dp(n + 1);
        dp[0][0] = -1;
        int res = 0;
        for (int i = 1; i <= n; i++) {
            if (dp[i - 1][0] > 0) {
                dp[i][0] = dp[i - 1][0] + b[i];
                dp[i][1] = 1;
            } else {
                dp[i][0] = b[i];
                dp[i][1] = 0;
            }
            res = max(res, dp[i][0]);
        }
        return ans + res >= (n + 1) / 2;
    };
    int l = 0, r = 1e9;
    while (l < r) {
        int mid = (l + r) / 2;
        if (check(mid)) l = mid;
        else r = mid - 1;
    }
    cout << l << '\n';
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    int t = 1; 
    // cin >> t;
    while(t--) solve();
    return 0;
}