#include<bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e16 + 7;
int n;
int a[300010],b[300010],f[300010];
bool check(int k){
	int ans = -INF,res = 0;
	for(int i = 1; i <= n; i++){
		int v = (int)(b[i] >= k) - (int)(a[i] >= k);
		res += (int)(a[i] >= k);
		f[i] = max(0LL,f[i - 1]) + v;
		ans = max(ans,f[i]);
	}
	return res + ans >= (n + 1) / 2;
}
signed main(){
	scanf("%lld",&n);
	for(int i = 1; i <= n; i++) scanf("%lld %lld",&a[i],&b[i]);
	int l = 1,r = 1e9;
	while(l < r){
		int mid = (l + r + 1) >> 1;
		if(check(mid)) l = mid;
		else r = mid - 1;
	}
	printf("%lld",l);
	return 0;
}