#include<cstdio>
const int MaxN=100010;
int N,a[MaxN*2];
bool b[MaxN*2];
bool chk(int M){
	for(int i=1;i<2*N;i++)b[i]=0;
	for(int i=2;i<2*N;i++)if((a[i]<M)==(a[i-1]<M))b[i-1]=b[i]=1;
	for(int i=N,j=N;i;i--,j++){
		if(b[i])return a[i]>=M;
		if(b[j])return a[j]>=M;
	}
	return a[1]>=M;
}
int main(){
	scanf("%d",&N);
	for(int i=1;i<2*N;i++)scanf("%d",a+i);
	int l=1,r=2*N,mid;
	while(r-l>1)chk(mid=l+r>>1)?l=mid:r=mid;
	printf("%d\n",l);
}