#include<bits/stdc++.h>
int n,a[100010];
bool b[100010];
inline bool check(int k){
	for(int i=1;i<=2*n-1;i++){
		if(a[i]>=k) b[i]=1;
		else b[i]=0;
	} 
	int l=n,r=n;
	while(l>1&&b[l-1]!=b[l]) l--;
	while(r<2*n-1&&b[r+1]!=b[r]) r++;
	if(l==1&&r==2*n-1) return (n&1)?b[n]:(b[n]^1);
	return n-l<r-n?b[l]:b[r];
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=2*n-1;i++) scanf("%d",&a[i]);
	int l=1,r=2*n-1,ans;
	while(l<=r){
		int mid=(l+r)/2;
		if(check(mid)){
			ans=mid;
			l=mid+1;
		}
		else r=mid-1;
	}
	printf("%d\n",ans);
	return 0;
}