#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
#define mod long(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(10)
#define highest(x) (63 - __builtin_clzl(x))

template< class T >
struct BinaryIndexedTree
{
    vector< T > data;
    
    BinaryIndexedTree(int sz)
    {
        data.assign(++sz, 0);
    }
    
    T sum(int k)
    {
        T ret = 0;
        for(++k; k > 0; k -= k & -k) ret += data[k];
        return (ret);
    }
    
    void add(int k, T x)
    {
        for(++k; k < data.size(); k += k & -k) data[k] += x;
    }
};

long N;
vector<int> a;

long median_of_medians(int upper){
    vector<int> under_upper_cumulative_sum{0};
    for(int i = 0; i < N; i++){
        int item;
        if(a[i] <= upper){
            item = under_upper_cumulative_sum.back() + 1;
        }else{
            item = under_upper_cumulative_sum.back() - 1;
        }
        under_upper_cumulative_sum.push_back(item);
    }
    pair<int, int> under_upper_cumulative_sum_points[N + 1];
    for(int i = 0; i <= N; i++){
        under_upper_cumulative_sum_points[i] = {under_upper_cumulative_sum[i], -i};
    }
    sort(under_upper_cumulative_sum_points, under_upper_cumulative_sum_points + N + 1);
    BinaryIndexedTree<long> BIT(N + 1);
    long ans = 0;
    for(int i = 0; i <= N; i++){
        ans += BIT.sum(-under_upper_cumulative_sum_points[i].second);
        BIT.add(-under_upper_cumulative_sum_points[i].second, 1);
    }
    return ans;
}

int main(){
    cin >> N;
    a.resize(N);
    for(int i = 0; i < N; i++){
        cin >> a[i];
    }
    vector<int> a_sorted = a;
    sort(all(a_sorted));
    a_sorted.erase(unique(all(a_sorted)), a_sorted.end());
    int left = -1, right = int(a_sorted.size()) - 1; // (left, right]
    while(left + 1 < right){
        int middle = (left + right) / 2;
        if(median_of_medians(a_sorted[middle]) >= N * (N + 1) / 4 + 1){
            right = middle;
        }else{
            left = middle;
        }
    }
    cout << a_sorted[right] << endl;
}


Measured memory_bytes: 3556