#include<bits/stdc++.h>
using namespace std;
int n,a[300005],b[300005],sum,maxn,c[300005],dp[300005];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i){
		scanf("%d%d",&a[i],&b[i]);
	}
	int l=0,r=1e9+2;
	while(l<r){
		int mid=(l+r)/2,sum=0;
//		cout<<mid<<endl;
		for(int i=1;i<=n;++i){
			if(a[i]<mid&&b[i]>=mid)c[i]=1,sum++;
			else if(a[i]>=mid&&b[i]<mid)c[i]=-1;
			else if(a[i]<mid)sum++,c[i]=0;
			else if(b[i]<mid)c[i]=0;
		} 
		dp[1]=c[1],maxn=max(0,c[1]);
		for(int i=2;i<=n;++i){
			dp[i]=max(dp[i-1]+c[i],c[i]);
			maxn=max(dp[i],maxn);
		}
//		cout<<sum<<' '<<maxn<<endl;
		sum-=maxn;
		if(sum<(n+1)/2)l=mid+1;
		else r=mid;
	}
	cout<<l-1<<endl;
	return 0;
}