#include <bits/stdc++.h>

using namespace std;
const int N=3*1e5+100;

int c[N],n,cnt1,cnt2;

struct node{
	int a,b;
}p[N];

inline void tj(int x,int y){
	if (x<y) cnt1++;
	if (x>y) cnt2++;
}

bool check(int t){
	int mx=0,l=1,ml=0,mr=0,cnt=0,d=0;
	for (int i=1;i<=n;i++){
		d=0;
		if (p[i].a<t && p[i].b>=t) d=1;
		if (p[i].a>=t && p[i].b<t) d=-1;
		cnt+=d;
		if (cnt>mx){
			mx=cnt;
			mr=i;ml=l;
		}
		if (cnt<0){
			cnt=0;
			l=i+1;
		}
	}
	cnt1=0,cnt2=0;
	for (int i=1;i<ml;i++) tj(p[i].a,t);
	for (int i=ml;i<=mr;i++) tj(p[i].b,t);
	for (int i=mr+1;i<=n;i++) tj(p[i].a,t);
	return cnt1<=n/2 && cnt2<=n/2;
}

int main(){
	scanf("%d",&n);
	for (int i=1;i<=n;i++){
		scanf("%d%d",&p[i].a,&p[i].b);
		c[i]=p[i].a;
	}
	sort(c+1,c+n+1);
	int l=c[n/2+1],r=1e9+1;
	while (l<r){
		if (l==r-1) break;
		int mid=l+r>>1;
		if (check(mid)) l=mid;
		else r=mid;
	}
	printf("%d\n",l);
	return 0;
}