#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
int n,a[300005],b[300005];
int c[300005],f[300005],suf[300005];
bool check(int x)
{
	for(int i=n;i>=1;i--)
		if(a[i]>=x)suf[i]=suf[i+1]+1;
		else suf[i]=suf[i+1];
	for(int i=1;i<=n;i++)
		if(a[i]>=x&&b[i]>=x)c[i]=0;
		else if(a[i]>=x)c[i]=-1;
		else if(b[i]>=x)c[i]=1;
		else c[i]=0;
	for(int i=1;i<=n;i++)
		f[i]=0;
	if(f[0]+suf[1]>=(n+1)/2)return 1;
	for(int i=1;i<=n;i++)
	{
		f[i]=max(c[i],c[i]+f[i-1]);
		if(f[i]+suf[i+1]>=(n+1)/2)return 1;
	}
	return 0;
}
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)/2;
		if(check(mid))l=mid+1;
		else r=mid-1;
	}
	cout<<l-1<<endl;
}
signed main()
{
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	int T=1;
	//cin>>T;
	while(T--)solve();
	return 0;
}
/*
5
3 6
5 2
4 7
6 4
2 8

1
2 1
*/