#include<bits/stdc++.h>
using namespace std;
inline int read(){
    int w=0,x=0;char c=getchar();
    while(!isdigit(c)) w|=c=='-',c=getchar();
    while(isdigit(c)) x=x*10+c-'0',c=getchar();
    return w?-x:x;
}
namespace star
{
    const int maxn=3e5+10;
    int n,a[maxn],b[maxn],c[maxn],cnt;
    inline bool check(int x){
        int s=0,mx=0,MX=0;
        for(int i=1;i<=n;i++){
            if(a[i]>=x) s++;
            if(b[i]>=x and a[i]<x) mx++;
            if(a[i]>=x and b[i]<x) mx=max(0,mx-1);
            MX=max(MX,mx);
        }
        return s+MX>n/2;
    }
    inline void work(){
        n=read();
        for(int i=1;i<=n;i++) a[i]=read(),b[i]=read(),c[++cnt]=a[i],c[++cnt]=b[i];
        sort(c+1,c+1+cnt);
        for(int i=1;i<=n;i++) a[i]=lower_bound(c+1,c+1+cnt,a[i])-c,b[i]=lower_bound(c+1,c+1+cnt,b[i])-c;
        int l=1,r=cnt,ans=1;
        while(l<=r){
            int mid=(l+r)/2;
            if(check(mid)) ans=mid,l=mid+1;
            else r=mid-1;
        }
        printf("%d\n",c[ans]);
    }
}
signed main(){
    star::work();
    return 0;
}