//Man always remember love because of romance only!
#include<bits/stdc++.h>
using namespace std;
inline int read(){
    int X=0,w=0; char ch=0;
    while(!isdigit(ch)) {w|=ch=='-';ch=getchar();}
    while(isdigit(ch)) X=(X<<3)+(X<<1)+(ch^48),ch=getchar();
    return w?-X:X;
}
inline void write(int x){
	if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
int a[300001],b[300001];
int n;
int c[300001];
int tp;
int check(int x){
	for(int i=1;i<=n;i++){
		c[i]=(b[i]>=x)-(a[i]>=x);
	}
	int ans=0,now=0,l=1,r=0;
	int ansl=1,ansr=0;
	for(int i=1;i<=n;i++){
		if(now+c[i]<c[i]) now=c[i],l=i,r=i;
		else now+=c[i],r++;
		if(now>ans) ansl=l,ansr=r;
		ans=max(ans,now);
	}
	int res=0;
	for(int i=1;i<=n;i++) res+=(a[i]>=x);
	if(res<=(n+1)/2&&res+ans>=(n+1)/2){
		tp=x;
		return 1;
	}
	if(res>(n+1)/2) return 1;
	return 0;
}
int d[600001];
int main(){
	n=read();
	int cnt=0;
	for(int i=1;i<=n;i++){
		a[i]=read(),b[i]=read();
		d[++cnt]=a[i],d[++cnt]=b[i];
	}
	sort(d+1,d+cnt+1);
	int l=1,r=cnt,res;
	while(l<=r){
		int mid=(l+r)/2;
		if(check(d[mid])) res=mid,l=mid+1;
		else r=mid-1;
	}	
	write(tp);
	return 0;
}