#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define endl "\n"
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i,a,b) for(int i=(int)a,i##i=(int)b;i<=i##i;i++)
#define per(i,a,b) for(int i=(int)a,i##i=(int)b;i>=i##i;i--)
mt19937_64 rnd(random_device{}());
#define int ll
typedef pair<int,int> pii;
const int N=200010;
const int mod=998244353;
int n,a[N],b[N],t[N];
int check(int x){
	for(int i=1;i<=n;i++){
		if(a[i]>=x&&b[i]>=x) t[i]=1;
		if(a[i]>=x&&b[i]<x) t[i]=-1;
		if(a[i]<x&&b[i]>=x) t[i]=1;
		if(a[i]<x&&b[i]<x) t[i]=0;
		t[i]+=t[i-1];
		//cout<<t[i]<<" \n"[i==n];
	}
	int l=0,r=0,sum=0;
	int mi=0,pos=0;
	for(int i=1;i<=n;i++){
		int x=t[i]-mi;
		if(x>sum){
			sum=x;
			l=pos+1;
			r=i;
		}
		if(t[i]<=mi){
			mi=t[i];
			pos=i;
		}
	}
	if(sum<=0) l=r=0;
	vector<int> ans;
	for(int i=1;i<=n;i++){
		if(i>=l&&i<=r) ans.push_back(b[i]);
		else ans.push_back(a[i]);
	}
	sort(ans.begin(),ans.end());
	return ans[n/2]>=x;
}
void solve(){
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i]>>b[i];
	int l=1,r=1e9;
	while(l<r){
		int mid=(l+r+1)>>1;
		if(check(mid)) l=mid;
		else r=mid-1;
	}
	cout<<l<<endl;
}
signed main(){
    IOS;
    int _=1;
    //cin>>_;
    while(_--){
        solve();
    }
}