#include<bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define rep2(i,j,k) for(int i=j;i>=k;i--)
using namespace std;
template<typename T> void read(T &num){
	char c=getchar();T f=1;num=0;
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){num=(num<<3)+(num<<1)+(c^48);c=getchar();}
	num*=f;
}
template<typename T> void qwq(T x){
	if(x>9)qwq(x/10);
	putchar(x%10+'0');
}
template<typename T> void write(T x){
	if(x<0){x=-x;putchar('-');}
	qwq(x);putchar('\n');
}
int n;
int a[300010];int b[300010];
int c[600010];
int t[300010];
bool chk(int mid){
	int cnt=0;
	rep(i,1,n)cnt+=(a[i]>mid);
	if(cnt>=(n-1)/2)return true;
	rep(i,1,n){
		t[i]=0;
		if(a[i]>mid)t[i]--;
		if(b[i]>mid)t[i]++;
		t[i]+=t[i-1];
	}
	int mi=0;
	rep(i,1,n){
		if(cnt+t[i]-mi>=(n-1)/2)return true;
		mi=min(mi,t[i]);
	}
	return false;
}
int main(){
	read(n);
	int len=0;
	rep(i,1,n){
		read(a[i]);
		read(b[i]);
		c[++len]=a[i];
		c[++len]=b[i];
	}
	sort(c+1,c+len+1);
	len=unique(c+1,c+len+1)-c-1;
	
	int ll=1;int rr=len;int ans=0;
	while(ll<=rr){
		int mid=(ll+rr)>>1;
		if(chk(c[mid])){ans=c[mid];ll=mid+1;}
		else{rr=mid-1;}
	}
	write(ans);
	return 0;
}