#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))

int N;
vector<int> a;

constexpr int INF = 10000000;
bool is_eq_greater(int val)
{
    vector<int> v(2 * N - 1);
    REP(i, 2 * N - 1) v[i] = (a[i] >= val);
    {
        bool flg = true;
        REP(i, N) if (!v[i * 2]) flg = false;
        if (flg) return true;
    }
    if (!v[N - 1] and !v[N]) return false;
    if (!v[N - 1] and !v[N - 2]) return false;
    if (v[N - 1] and v[N]) return true;
    if (v[N - 1] and v[N - 2]) return true;

    int r2 = -1, l2 = -1, r1 = N - 1, l1 = N - 1;
    REP(k, N - 1)
    {
        if (v[N - 1 + k] + v[N - 1 + k + 1] == 0) break;
        r1 = N - 1 + k;
        if (v[N - 1 + k] + v[N - 1 + k + 1] == 2) { r2 = N - 1 + k + 1; break; }
    }
    REP(k, N - 1)
    {
        if (v[N - 1 - k] + v[N - 1 - k - 1] == 0) break;
        l1 = N - 1 - k;
        if (v[N - 1 - k] + v[N - 1 - k - 1] == 2) { l2 = N - 1 - k - 1; break; }
    }
    if (l2 >= 0 and r2 >= 0) return true;
    if (l2 < 0 and r2 >= 0 and (l1 + r1) / 2 <= N - 1) return true;
    if (r2 < 0 and l2 >= 0 and (l1 + r1) / 2 >= N - 1) return true;
    return false;
}


int main()
{
    cin >> N;
    a.resize(2 * N - 1);
    cin >> a;

    int L = 0, R = N * 2 + 1; // [L, R)
    while (R - L > 1)
    {
        int C = (L + R) / 2;
        (is_eq_greater(C) ? L : R) = C;
    }
    cout << L << endl;
}


Measured memory_bytes: 1808