#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)n;i++)


template <typename T>
struct BIT{
    int n;
    vector<T> d;

    BIT(int sz){
        n = sz+10;
        d.resize(n);
    }

    void add(int i, T x){

        while(i<=n){
            d[i] += x;
            i += i&-i;
        }
    }

    T getSum(int i){
        T ret = 0;

        while(i>0){
            ret += d[i];
            i -= i&-i;
        }
        return ret;
    }

    T getSum(int a, int b){
        return getSum(b-1) - getSum(a-1);
    }
};


int main(){
    ll N; cin >> N;
    vector<ll> a(N);
    rep(i,N) cin >> a[i];

    ll ng = 0, ok = 1e9;
    while(ok-ng>1){
        ll mid = (ng+ok)/2;

        ll sum = 0, num = 0;
        BIT<ll> bit(N*2+10);
        bit.add(N+1,1);
        rep(i,N){
            if(a[i]<=mid) sum++;
            else sum--;
            num += bit.getSum(1,sum+N+1);
            bit.add(sum+N+1,1);
        }
        if (num > (N+1)*N/2/2) ok = mid;
        else ng = mid;
    }

    cout << ok << endl;
}