#include <bits/stdc++.h>
#define N 1000009
using namespace std;
int n, a[N], b[N];
int s[N], maxx[N], sum[N];

bool ok(int mid) {
	for (int i = 1; i <= n; i++)
		s[i] = (a[i] >= mid) - (b[i] >= mid);
	int maxxx = -1e9;
	for (int i = 1; i <= n; i++)
		sum[i] = sum[i - 1] + s[i];
	for (int i = n; i; i--)
		maxx[i] = max(maxx[i + 1], sum[i]);
	for (int i = 1; i <= n; i++)
		maxxx = max(maxxx, maxx[i] - sum[i]);
	maxxx = max(maxxx, maxx[1]);
	for (int i = 1; i <= n; i++)
		maxxx += (a[i] >= mid);
	return maxxx >= n / 2 + 1;
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		scanf("%d%d", &a[i], &b[i]);
	int l = 1, r = 1000000000, ans;
	while (l <= r) {
		int mid = (l + r) >> 1;
		if (ok(mid))
			l = mid + 1, ans = mid;
		else
			r = mid - 1;
	}
	cout << ans;
	return 0;
}