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

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define elif else if
#define all(a, v, ...)                                                         \
    ([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)
#define rall(a, v, ...)                                                        \
    ([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v)
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}

// Debug
#define debug(...)                                                             \
    {                                                                          \
        cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                     \
        for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] ";               \
        cerr << rt;                                                            \
    }

#define dump(a, h, w)                                                          \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [" << rt;                        \
        rep(_i, h) {                                                           \
            rep(_j, w) cerr << a[_i][_j] << sp;                                \
            cerr << rt;                                                        \
        }                                                                      \
        cerr << "]" << rt;                                                     \
    }

#define vdump(a, n)                                                            \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [";                              \
        rep(_i, n) if (_i) cerr << sp << a[_i];                                \
        else cerr << a[_i];                                                    \
        cerr << "]" << rt;                                                     \
    }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
    io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// Math
inline constexpr ll gcd(const ll a, const ll b) {
    return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
    ll k = n % m;
    return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
    n %= m;
    return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
    ll r = 1;
    rep(i, 64) {
        if (n & (1LL << i)) r *= a;
        chmod(r, m);
        a *= a;
        chmod(a, m);
    }
    return r;
}
inline ll inv(const ll n, const ll m = MOD) {
    ll a = n, b = m, x = 1, y = 0;
    while (b) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        x -= t * y;
        swap(x, y);
    }
    return modulo(x, m);
}

struct LatteTree {
    using Type = ll;
    Type unit = 0;
    function<Type(Type, Type)> comb = [](Type left, Type right) {
        return left + right;
    };

    static const ll n = 1 << 20;
    vector<Type> node;

    LatteTree() : node(2 * n - 1, unit) {}
    inline void combine(ll a, ll b, Type x, ll i = 0, ll l = 0,
                        ll r = 1 << 20) {
        if (b <= l or r <= a) return;
        if (a <= l and r <= b) {
            node[i] = comb(node[i], x);
        } else {
            combine(a, b, x, i * 2 + 1, l, (l + r) / 2);
            combine(a, b, x, i * 2 + 2, (l + r) / 2, r);
        }
    }
    inline Type result(ll x) {
        Type res = unit;
        ll l = 0, r = n, i = 0;
        while (r - l > 1) {
            res = comb(res, node[i]);
            ll mid = (l + r) / 2;
            if (l <= x and x < mid) {
                r = mid;
                i = 2 * i + 1;
            } else {
                l = mid;
                i = 2 * i + 2;
            }
        }
        return comb(res, node[i]);
    }
};

signed main() {
    ll N;
    cin >> N;
    ll A[100000];
    rep(i, N) cin >> A[i];
    ll ok = *min_element(A, A + N), ng = *max_element(A, A + N) + 1;
    auto f = [&](ll x) {
        ll B[N + 1];
        rep(i, N) {
            if (A[i] >= x)
                B[i + 1] = 1;
            else
                B[i + 1] = -1;
        }
        B[0] = 0;
        rep(i, N) B[i + 1] += B[i];
        LatteTree seg;
        ll res = 0;
        rep(i, N + 1) {
            res += seg.result(B[i] + 200000);
            seg.combine(B[i] + 200000, 400001, 1);
            if (res >= N * (N + 1) * 0.25) return true;
        }
        return false;
    };
    while (ng - ok > 1) {
        ll md = (ok + ng) / 2;
        if (f(md)) {
            ok = md;
        } else {
            ng = md;
        }
    }
    cout << ok << rt;
}

// -g -D_GLIBCXX_DEBUG -fsanitize=undefined


Measured memory_bytes: 18176