#include <bits/stdc++.h>
using namespace std;

const int N = 3e5 + 10;
typedef pair<int, int> PII;
int a[N], b[N];
PII c[N];
int idx[N];
int n;
bool cmp (int x, int y) {
	return c[x] < c[y];
}

bool check(int x) {
	int y = x - 1 - (n - 1) / 2;
	int cnt = 0;
	for (int i = 1; i < x; i++) {
		if (c[idx[i]].second >= c[idx[x]].first)
			cnt++;
	}
	return cnt >= y;


}


int main () {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i] >> b[i];
		c[i] = { a[i], b[i] };
		idx[i] = i;
	}
	sort (idx + 1, idx + n + 1, cmp);
	// for (int i = 1; i <= n; i++) {
	// 	cout << c[idx[i]].first << " " << c[idx[i]].second << endl;
	// }

	int l = ((n + 1) / 2), r = n;
	while (l < r) {
		int mid = (l + r + 1) / 2;
		if (check(mid)) l = mid;
		else r = mid - 1;
	}
	cout << c[idx[l]].first << endl;



	return 0;
}