#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <utility>
struct asd{
	int a;
	int b;
	int ind;
	int c;
}w[300001];
bool cmp1(asd ar, asd br){
	return ar.a<br.a;
}
bool cmp2(asd ar, asd br){
	return ar.ind<br.ind;
}
int main(){
	int n;
	scanf("%d", &n);
	for (int i=0; i<n; ++i){
		scanf("%d %d", &w[i].a, &w[i].b);
		w[i].ind=i;
	}
	std:: sort(w, w+n, cmp1);
	for (int i=0; i<n; ++i){
		if (w[i].b>w[n/2].a) ++w[i].c;
		else if (w[i].b<w[n/2].a) --w[i].c;
	}
	std:: sort(w, w+n, cmp2);
	for (int i=0; i<n; ++i) w[i].c+=w[i-1].c; 
	int maxxx=0, minn=0;
	int l=-1, r=0;
	for (int i=0; i<n; ++i){
		if (w[i].c-minn>maxxx){
			maxxx=w[i].c-minn;
			r=i;
		}
		if (w[i].c<minn){
			minn=w[i].c;
			l=i;
		}
	}
	if (maxxx>0) for (int i=l+1; i<=r; ++i) w[i].a=w[i].b;
	//for (int i=0; i<n; ++i) printf("%d ", w[i].a);
	std:: sort(w, w+n, cmp1);
	printf("%d\n", w[n/2].a);
	return 0;
}