#include<bits/stdc++.h>
using namespace std;
int N;
int a[202020];
bool can(int x)
{
    for(int i=0; i<N-1; ++i)
    {
        if((a[N-1-i]>=x) == (a[N-1-i-1]>=x))
            return a[N-1-i]>=x;
        if((a[N-1+i]>=x) == (a[N-1+i+1]>=x))
            return a[N-1+i]>=x;
    }
    return a[0] >= x;
}
int main()
{
    scanf("%d", &N);
    for(int i=0; i<2*N-1; ++i)
        scanf("%d", a+i);
    int lo = 0; //true
    int hi = 2*N; //false
    while(lo+1!=hi)
    {
        int mi = (lo+hi)/2;
        if(can(mi))
            lo = mi;
        else
            hi = mi;
    }
    printf("%d\n", lo);
    return 0;
}