#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 check(int x) {
	int y = (n + 1) / 2 - 1;
	int cnt = 0;
	int maxx = 0;
	//最少能有多少个比x小的数
	for (int i = 1; i <= n; i++) {
		if(c[i].first < x){
			cnt++;
			if(c[i].second >= x){
				maxx ++;//[L,R]的最大贡献
			}
		}
		if(c[i].first >= x){
			if(c[i].second < x){
				maxx -= 1;
			}
			maxx = max(0 , maxx);
		}
		
	}
	return cnt - maxx <= y;
}
int main () {
	cin >> n;
	set<int>st;
	for (int i = 1; i <= n; i++) {
		cin >> a[i] >> b[i];
		c[i] = {a[i], b[i]};
		st.insert(a[i]);
		st.insert(b[i]);
	}
	vector<int>v;
	for(auto it : st){
		v.push_back(it);
	}
	int l = 0 , r = v.size() - 1;
	while (l < r) {
		int mid = (l + r + 1) / 2;
		if (check(v[mid])) l = mid;
		else r = mid - 1;
	}
	cout << v[l] << endl;
	return 0;
}