#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;

bool check(long long mid, const std::vector<std::pair<int, int>>& cards) {
    int s1 = 0;
    std::vector<int> c(cards.size());
    for (int i = 0; i < cards.size(); i++) {
        const auto& card = cards[i];
        if (card.first >= mid) {
            s1++;
        }
        c[i] = (card.second >= mid) - (card.first >= mid);
    }

    int maxSubArraySum = c[0];
    int currentSubArraySum = c[0];
    for (int i = 1; i < c.size(); i++) {
        currentSubArraySum = max(c[i], currentSubArraySum + c[i]);
        maxSubArraySum = max(maxSubArraySum, currentSubArraySum);
    }

    int s2 = maxSubArraySum;
    return s1 + s2 > cards.size() / 2;
}

int main() {
    int n;
    cin >> n;
    vector<pair<int, int>> cards(n);
    for (int i = 0; i < n; i++) {
        cin >> cards[i].first >> cards[i].second;
    }

    long long l = 1, r = 1e9;
    while (l < r) {
        long long mid = (l + r + 1) / 2;
        if (check(mid, cards)) {
            l = mid;
        } else {
            r = mid - 1;
        }
    }
    cout << l << endl;
    return 0;
}