#include<bits/stdc++.h>
using namespace std;


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

li a[200200];
li b[200200];
li d[200200];
li n;

inline bool chk(li x) {
    rep(i, 2 * n + 1) {
        if (a[i] >= x)b[i] = 1;
        else b[i] = 0;
    }
    bool all = true;
    rep(i, 2 * n) {
        d[i] = b[i] ^ b[i + 1];
        if (d[i] == 0)all = false;
    }
    //dump(b, 2 * n - 1);
    //dump(d, 2 * n - 2);
    if (all)return b[0] == 1;
    if ((b[n - 1] == 0 && b[n] == 0) ||
            (b[n] == 0 && b[n + 1] == 0)) {
        return false;
    }
    if ((b[n - 1] == 1 && b[n] == 1) ||
            (b[n] == 1 && b[n + 1] == 1)) {
        return true;
    }
    // どちらかから00, 11の波が中央に伝搬してくる
    // まず、01が交互に続く部分の「両端」を求める
    // 両端の先が00なのか11なのかを求める
    // 00, 11の近いほうが最上段まで伝搬する
    li left = n, right = n;
    while (d[right] > 0)right++;
    while (d[left - 1] > 0)left--;
    // p2(left, right);
    // b[left-1]==b[left], b[right]==b[right+1]
    li ll = b[left], rr = b[right];
    li dll = n - left, drr = right - n;
    if (drr < dll) {
        return rr == 1;
    } else {
        return ll == 1;
    }
}


int main() {
    cin >> n;
    rep(i, n * 2 - 1) {cin >> a[i + 1];}
    a[0] = a[1];
    a[n * 2] = a[n * 2 - 1];

    li l = 0, r = n * 2;
    while (l + 1 < r) {
        li mid = (l + r) / 2;
        //p3(l, r, mid);
        if (chk(mid)) {
            l = mid;
        } else {
            r = mid;
        }
    }
    cout << l << endl;

    return 0;
}

Measured memory_bytes: 4992