#include <iostream>
#include <vector>
#include <algorithm>
#define int long long
using namespace std;

signed main() {
  int N; cin >> N;
  vector<int> a(N), s(N), l(N+1);
  l[0] = 0;
  for(int i = 0; i < N; ++i) {
    cin >> a[i];
    s[i] = a[i];
  }
  sort(s.begin(), s.end());
  int right = N-1;
  int left = 0;
  while(right != left) {
    int j = (right + left + 1) / 2;
    int num = s[j];
    for(int i = 0; i < N; ++i) {
      if(a[i] >= num) {
        l[i+1] = 1;
      } else {
        l[i+1] = -1;
      }
    }
    for(int i = 1; i <= N; ++i) l[i] += l[i-1];


    int count, t = 0;
    vector<int> bit(2*N+2, 0);
    for(int i = 0; i < N + 1; ++i) {
      int first = l[i] + N + 1;
      for(int x = first; x <= 2 * N + 1; x += x&-x) {
        bit[x]++;
      }
      int sum = 0;
      for(int x = first; x >= 1; x-=x&-x) sum += bit[x];
      t += i+1-sum;
    }
    count = N * (N + 1) / 2 - t;
    if(count >= (N * (N+1)/2+1)/2) {
      left = j;
    } else {
      right = j - 1;
    }
  }
  cout << s[left] << endl;

  return 0;
}
