#include <bits/stdc++.h>
using namespace std;
#define all(V) V.begin(),V.end()
#define ll long long
#define MOD 1000000007

ll seg[524288];

ll rsq(int s, int t, int k = 1, int l = 0, int r = 262143) {
	if (t < l || r < s)return 0;
	if (s <= l && r <= t)return seg[k];
	ll lv = rsq(s, t, k * 2, l, (l + r) / 2);
	ll rv = rsq(s, t, k * 2 + 1, (l + r) / 2 + 1, r);
	return lv + rv;
}

void upd(ll x) {
	x += 262144;
	seg[x]++;
	while (x) {
		x /= 2;
		seg[x] = seg[x * 2] + seg[x * 2 + 1];
	}
}

int main() {
	for (int i = 0;i < 524288;i++)seg[i] = 0;
	ll N, L;
	cin >> N;
	L = N * (N + 1) / 2;
	vector<ll> A(N), AR(N);
	for (int i = 0;i < N;i++) {
		cin >> A[i];
		AR[i] = A[i];
	}
	sort(all(AR));

	ll ng = -1, ok = N - 1, T, x, y, s;
	vector<ll> B(N + 1, 0);
	while (ng + 1 != ok) {
		T = (ok + ng) / 2;
		x = AR[T];

		for (int i = 0;i < 524288;i++)seg[i] = 0;
		for (int i = 0;i < N;i++) {
			if (A[i] > x)B[i + 1] = -1;
			else B[i + 1] = 1;

			B[i + 1] += B[i];
		}

		s = 0;
		for (int i = 0;i <= N;i++) {
			upd(B[i] + 100005);
			s += rsq(0, B[i] + 100004);
		}
		if (s < L / 2 + 1)ng = T;
		else ok = T;
	}
	cout << AR[ok] << endl;
}