#include <cstdio>

int N;
int as[200000];
int bs[200000];

int check(int x){
  for(int i=1;i<N;i++){
    if(bs[N-i]==bs[N-i+1]||bs[N+i]==bs[N+i-1]){
      return bs[N-i+1];
    }
  }
  return bs[1];
}

int main(){
  scanf("%d",&N);
  for(int i=1;i<=N*2-1;i++){
    scanf("%d",&as[i]);
  }
  int low=1,high=N*2;
  while(high-low>1){
    int mid=(low+high)/2;
    for(int i=1;i<=N*2-1;i++){
      bs[i]=(as[i]>=mid);
    }
    if(check(mid)){
      low=mid;
    }else{
      high=mid;
    }
  }
  printf("%d\n",low);
  return 0;
}
