#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const int N=3e5+5;
int n;
ll a[N],b[N];
ll c[N];
bool check(ll mid){
	ll mx=0;
	ll cur=0;
	ll sum=0;
	for(int i=1; i<=n ;i++){
		c[i]=(b[i]>=mid)-(a[i]>=mid);
		sum+=(a[i]>=mid);
		cur=max(0LL,cur+c[i]);
		mx=max(mx,cur);
	}
	if(sum+cur>n/2) return true;
	else return false;
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	cin >> n;
	for(int i=1; i<=n ;i++){
		cin >> a[i] >> b[i];
	}
	ll l=0,r=1e9;
	while(l!=r){
		ll mid=(l+r+1)/2;
		if(check(mid)) l=mid;
		else r=mid-1;
	}
	cout << l << '\n';
}