#include <cstdio>
#include <algorithm>
using namespace std;

int main()
{
  int n;
  scanf("%d",&n);
  static int a[200000];
  for(int i=0;i<2*n-1;i++){
    scanf("%d",a+i);
  }
  int L=1,R=2*n;
  while(L+1<R){
    int d=(L+R)/2;
    int x=0,y=0;
    while(x<=n-2&&!(a[n-1-x]<d&&a[n-2-x]<d)&&!(a[n-1+x]<d&&a[n+x]<d)){\
      x++;
    }
    while(y<=n-2&&!(a[n-1-y]>=d&&a[n-2-y]>=d)&&!(a[n-1+y]>=d&&a[n+y]>=d)){\
      y++;
    }
    if(y<x||(y==x&&((a[n-1]>=d&&n%2==1)||(a[n-1]<d&&n%2==0)))){
      L=d;
    }
    else{
      R=d;
    }
  }
  printf("%d\n",L);
  return 0;
}
