#include <bits/stdc++.h> using namespace std; int n; vector<int> a; namespace kkk { int dfs(int cs) { if (cs == n) return a.front(); int ans = (cs & 1 ? -1 : 0x3f3f3f3f), scz; vector<int>::iterator it = a.begin(), it2 = it, sc, ls; ++it2; for (; it2 != a.end(); ++it, ++it2) { if (cs & 1) { ((*it > *it2) ? (sc = it, scz = *it) : (sc = it2, scz = *it2)); ls = sc; a.erase(sc); ans = max(ans, dfs(cs + 1)); a.insert(ls, scz); } else { ((*it < *it2) ? (sc = it, scz = *it) : (sc = it2, scz = *it2)); ls = sc; a.erase(sc); ans = min(ans, dfs(cs + 1)); a.insert(ls, scz); } } return ans; } void kkk() { cout << dfs(1) << endl; } } void solve() { scanf("%d", &n); bool all0 = true, all01 = true; for (int x, i = 1; i <= n; ++i) { scanf("%d", &x); a.push_back(x); if (x != 0) all0 = false; if (x != 0 && x != 1) all01 = false; } if (all0) cout << 0 << endl; if (all01) cout << 1 << endl; else kkk::kkk(); } int main() { //freopen("game.in", "r", stdin); //freopen("game.out", "w", stdout); solve(); return 0; }