#include <bits/stdc++.h>

using i64 = long long;

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

    int n;
    std::cin >> n;

    std::vector<std::array<int, 2>> card(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 2; j++) {
            std::cin >> card[i][j];
        }
    }


    auto check = [&](int x) -> bool {
        std::array<int, 3> dp {};
        for (int i = 0; i < n; i++) {
            std::array<int, 3> ndp {};
            for (int s = 0; s < 3; s++) {
                if (s == 2) {
                    ndp[2] = std::max(ndp[2], dp[2] + (card[i][0] >= x));
                } else if (s == 1) {
                    ndp[1] = std::max(ndp[1], dp[1] + (card[i][1] >= x));
                    ndp[2] = std::max(ndp[2], dp[1] + (card[i][0] >= x));
                } else {
                    ndp[0] = std::max(ndp[0], dp[0] + (card[i][0] >= x));
                    ndp[1] = std::max(ndp[1], dp[0] + (card[i][1] >= x));
                }
            }
            dp = std::move(ndp);
        }
        int res = *std::max_element(dp.begin(), dp.end());
        return res >= (n + 1) / 2;
    };

    int lo = 1, hi = 10, ans = -1;
    while (lo <= hi) {
        int mid = lo + (hi - lo) / 2;
        if (check(mid)) {
            ans = mid;
            lo = mid + 1;
        } else {
            hi = mid - 1;
        }
    }
    std::cout << ans << "\n";

    return 0;
}