#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<int> a(n), b(n);
	for (int i = 0; i < n; i++) {
		std::cin >> a[i] >> b[i];
	}

	auto check = [&](int x) {
		std::vector<int> pre1(n + 1), pre2(n + 1), suf(n + 2);
		for (int i = 0; i < n; i++) {
			pre1[i + 1] = pre1[i] + (a[i] >= x);
			pre2[i + 1] = pre2[i] + (b[i] >= x);
		}
		for (int i = n; i >= 1; i--) {
			suf[i] = suf[i + 1] + (a[i - 1] >= x);
		}

		int res = 0, ans = 0;
		for (int i = 1; i <= n; i++) {
			res = std::max(res, pre1[i - 1] - pre2[i - 1]);
			ans = std::max(ans, res + suf[i + 1] + pre2[i]);
		}

		return ans >= (n + 1) / 2;
	};
	int lo = 0, hi = int(1E9);
	while (hi - lo != 1) {
		int m = (lo + hi) / 2;
		if (check(m)) {
			lo = m;
		} else {
			hi = m;
		}
	}

	check(6);
	std::cout << lo << "\n";

	return 0;
}