#include <bits/stdc++.h>
using namespace std;
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> (i)) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i <= x; i++)
#define FORA(i, n) for (auto &&i : n)
#define POW(a, b) ((int)(pow(a, b) + .5))
#define DUMPOUT cerr
// vector
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec) is >> x;
  return is;
}
// pair
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
// vector
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << "{";
  REP(i, (int)vec.size())
  os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
  os << "}";
  return os;
}
// map
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) {
  os << "{";
  FORA(itr, map_var) {
    os << *itr;
    itr++;
    if (itr != map_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
// set
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
  os << "{";
  FORA(itr, set_var) {
    os << *itr;
    itr++;
    if (itr != set_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) > 0) DUMPOUT << ", ";
  dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define DUMP(...)                                                             \
  DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                             \
          << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
          << "    ",                                                          \
      dump_func(__VA_ARGS__)
#define PRINTARR(x, y)                                     \
  cerr << #x << "=\n";                                     \
  for (auto itr = x; itr != y; itr++) cerr << *itr << " "; \
  cerr << endl;
#define PRINTARR2(x, i0, i1)                                       \
  cerr << #x << "=\n";                                             \
  for (int ii0 = 0; ii0 < i0; ii0++) {                             \
    for (int ii1 = 0; ii1 < i1; ii1++) cerr << x[ii0][ii1] << " "; \
    cerr << endl;                                                  \
  }
#else
#define DEB if (false)
#define DUMP(...)
#define PRINTARR(x, y)
#define PRINTARR2(x, i0, i1)
#endif
#define ALL(v) v.begin(), v.end()
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define epb emplace_back
#define int long long
#define pint pair<int, int>
#define ld long double
using namespace std;
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;
}
template <class T> using vec = std::vector<T>;
template <class T> void print(const T &x) { cout << x << "\n"; }
const int MOD = 1000000007, INF0 = 1061109567, INF = INF0 * INF0;
const double EPS = 1e-10, PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
/*
[&] { return; }();下のスラッシュを2つ追加しただけ.上のスラッシュを2つにすれば外れる.
//*/
// http://drken1215.hatenablog.com/entry/2018/09/08/011500
// http://drken1215.hatenablog.com/entry/2018/09/08/011500
// http://drken1215.hatenablog.com/entry/2018/09/08/011500
template <class Abel> struct BITree {
  const Abel UNITY_SUM = 0;  // to be set
  vector<Abel> dat;

  /* [1, n] */
  BITree(int n) : dat(n + 1, UNITY_SUM) {}
  void init(int n) { dat.assign(n + 1, UNITY_SUM); }

  /* a is 1-indexed */
  inline void add(int a, Abel x) {
    for (int i = a; i < (int)dat.size(); i += i & -i) dat[i] = dat[i] + x;
  }

  /* [1, a], a is 1-indexed */
  inline Abel sum(int a) {
    Abel res = UNITY_SUM;
    for (int i = a; i > 0; i -= i & -i) res = res + dat[i];
    return res;
  }

  /* [a, b), a and b are 1-indexed */
  inline Abel sum(int a, int b) { return sum(b - 1) - sum(a - 1); }

  /* debug */
  void print() {
    for (int i = 1; i < (int)dat.size(); ++i) cout << sum(i, i + 1) << ",";
    cout << endl;
  }
};
#define MAXN 100100
int a[MAXN];
bool flg[MAXN];
int sum, midnum;

signed main() {
  cin.tie(0), ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  int N;
  cin >> N;
  REP(i, N) cin >> a[i];
  int left = 0;     // true
  int right = INF;  // false
  int numpair = N * (N + 1) / 2;
  midnum = (numpair + 1) / 2;
  const int geta = N + 1;  //これはマイナスに移動する可能性があるため
  //その中央値がval以上か<->数列和が0以上
  while (right - left > 1) {
    int mid = (left + right) / 2;
    BITree<int> bit(N * 2 + 10);
    //このテーブルはaの大きさに依存するもの。
    //入れるものはaではなくaの累積和で有ることに注意
    int sum = 0;
    int num = 0;
    bit.add(sum + geta, 1);
    // S[i]<=S[j]になる個数を数えたい
    // i<j S[i]<=S[j]となる個数
    REP(i, N) {
      int val = (a[i] >= mid) ? 1 : -1;
      // int val = (a[i] <= mid) ? 1 : -1;
      sum += val;
      int ret = bit.sum(1, sum + geta + 1);
      // b0からbsum(aj)までの和をnumとする。
      num += ret;
      // bsum(aj)に1を加算
      DUMP(mid, i, num, sum, ret, bit.sum(geta - 1, geta - 1), bit.sum(geta, geta), bit.sum(geta + 1, geta + 1));
      bit.add(sum + geta, 1);
    }
    DUMP(mid, num, sum, bit.sum(geta - 1, geta - 1), bit.sum(geta, geta), bit.sum(geta + 1, geta + 1));

    //総和が0になれば中央値はmid以上！
    // midnum以上mid以上あればtrue.

    if (num >= midnum) {
      left = mid;
    } else {
      right = mid;
    }
  }
  print(left);
}


Measured memory_bytes: 2668