#include <bits/stdc++.h>

using namespace std;
using pi = pair<int, int>;
constexpr int INF = 1e9 + 7;

int main() {
    cin.tie(0)->sync_with_stdio(false);
    int n;
    cin >> n;
    vector<pi> a(n);
    for (auto &[x, y]: a)cin >> x >> y;
    int l = 0, r = INF;
    int need = (n + 1) / 2;
    while (r - l > 1) {
        int mid = (r + l) / 2;
        int bal = 0;
        vector<int> v(n, 0);
        for (int i = 0; i < n; ++i) {
            if (a[i].first >= mid) {
                ++bal;
                --v[i];
            } else {
                --bal;
                ++v[i];
            }
            if (a[i].second >= mid) {
                ++v[i];
            } else {
                --v[i];
            }
        }
        int mx = 0, mn = 0, cur = 0;
        for (int i = 0; i < n; ++i) {
            cur += v[i];
            mx = max(mx, cur + mn);
            mn = min(mn, cur);
        }
        bal += mx;
        if (bal >= 0) {
            l = mid;
        } else r = mid;
    }
    cout << l << "\n";
}