#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    vector<int> a(n + 1), b(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
    }

    auto check = [&](int x) {
        vector<int> A(n + 2), B(n + 2), C(n + 2);
        for (int i = 1; i <= n; i++) {
            if (a[i] >= x) A[i] = A[i - 1] + 1;
            else A[i] = A[i - 1];
            if (b[i] >= x) B[i] = B[i - 1] + 1;
            else B[i] = B[i - 1];
        }
        for (int i = n; i >= 1; i--) {
            if (a[i] >= x) C[i] = C[i + 1] + 1;
            else C[i] = C[i - 1];
        }

        int maxv = 0, res = 0;
        for (int i = 1; i <= n; i++) {
            res = max(res, B[i] + maxv + C[i + 1]);
            maxv = max(maxv, A[i] - B[i - 1]);
        }
        return res >= (n + 1) / 2;
    };

    int l = 1, r = 1e9;
    while (l < r) {
        int mid = (l + r + 1) / 2;
        if (check(mid)) l = mid;
        else r = mid - 1;
    }
    cout << r << '\n';

    return 0;
}