#include <bits/stdc++.h>

using namespace std;

// #define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;
typedef multiset<int>::iterator iter;

const int N = 200010;
const int INF = 0x3f3f3f3f;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, a[N];

namespace BF
{
    multiset<int> mst, ans;

    void solve()
    {
        for (int i = 1; i <= n; i ++)
        {
            mst.clear();
            for (int j = i; j <= n; j ++)
            {
                mst.insert(a[j]);
                iter st = mst.begin();
                advance(st, (mst.size() - 1) / 2);
                ans.insert(*st);
            }
        }

        iter st = ans.begin();
        advance(st, (ans.size() - 1) / 2);
        cout << *st << '\n';
    }
}

signed main()
{
    read(n);
    for (int i = 1; i <= n; i ++) read(a[i]);
    if (n <= 5000) BF::solve();

    return 0;
}