#include<bits/stdc++.h>
#define int long long
using namespace std;
int n;
int a[300005],b[300005];
int pa[300005],pb[300005],mx[300005];
bool check(int x){
	int cc=0;
	for(int i=1;i<=n;i++)cc+=(a[i]>=x);
	if(cc>=(n+1)/2)return 1;
	int cur=0;
	for(int i=1;i<=n;i++)pa[i]=pa[i-1]+(a[i]>=x),pb[i]=pb[i-1]+(b[i]>=x);
	mx[0]=0;
	for(int i=1;i<=n;i++)mx[i]=max(mx[i-1],pa[i]-pb[i]);
	for(int r=n;r>=1;r--){
		//[l,r]
		//0<=l<r
		int to=(n+1)/2-cur;
		//pb[r]-pb[l-1]+pa[l-1]>=to
		if(mx[r-1]>=to-pb[r])return 1;
		cur+=(a[r]>=x);
	}
	return 0;
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i]>>b[i];
	int l=1,r=(int)1e9;
	//有可能有 (n+1)/2 个数 >=x 吗?
	int res=0;
	while(l<=r){
		int mid=(l+r)/2;
		if(check(mid))res=mid,l=mid+1;
		else r=mid-1;
	}
	cout<<res<<"\n";
	return 0;
}