#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define ll long long
#define midl (l+r)>>1 
const int maxn=1e6+7;
using namespace std;
int n,l,r,mid,arc[maxn];
bool check(int pp)
{
	if (arc[n]<=pp&&arc[n+1]<=pp) return 1;
	if (arc[n]<=pp&&arc[n-1]<=pp) return 1;
	if (arc[n]>pp&&arc[n+1]>pp) return 0;
	if (arc[n]>pp&&arc[n-1]>pp) return 0;
	rep(i,1,n) 
	 {
	 	if (arc[n+i]<=pp&&arc[n+i+1]<=pp) return 1;
	    if (arc[n-i]<=pp&&arc[n-i-1]<=pp) return 1;
     	if (arc[n+i]>pp&&arc[n+i+1]>pp) return 0;
    	if (arc[n-i]>pp&&arc[n-i-1]>pp) return 0;
	 }
}
int main(){
	scanf("%d",&n);
	rep(i,1,(n<<1)-1) 
	 scanf("%d",&arc[i]);
	for (r=(n<<1)-1,mid=l+r>>1;l<r;mid=l+r>>1)//while(l<r) 
	 if (check(mid)==1) r=mid;
	 else l=mid+1;
	cout<<l;
	return 0;
}