#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m;

void solve () {
	cin>>n;
	vector<int>a(n+1);
	vector<int>b(n+1);
	for(int i=1;i<=n;i++){
		cin>>a[i]>>b[i];
	}	
	int l=1,r=1e9;
	auto check=[&](int x)->bool{
		{}
		vector<int>c(n+1,0),d(n+1,0),pre(n+1,0);
		for(int i=1;i<=n;i++){
			if(a[i]>=x)c[i]=1;
			if(b[i]>=x)d[i]=1;
		}
		int num=0;
		for(int i=1;i<=n;i++)pre[i]=pre[i-1]+c[i];
		int l=1;
		int maxx=pre[n];
		for(int i=1;i<=n;i++){
			if(num-c[i]+d[i]<=0){
				num=0;
				l=i+1;
			}else{
				num+=-c[i]+d[i];
				maxx=max(maxx,num+pre[n]-pre[i]+pre[l-1]);
			}
		}
		return maxx>= (n+1 >>1);
	};
	while(l<r){
		int mid=l+r+1>>1;
		if(check(mid))l=mid;
		else r=mid-1;
	}
	cout<<l<<endl;
}
signed main () {
	int T = 1; 
	std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	//cin>>T;
	while (T --) solve ();
	return 0;
}