#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<time.h>
#include<cassert>

using namespace std;
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(),(a).end()
#define EPS (1e-13)
#define bit(n,k) ((n>>k)&1)
const ll Mod = 1e9 + 7;
const ll mod = 998244353;
struct H {
	ll x, y;
	bool operator<(const H& b) const {
		if (x != b.x) return x < b.x;
		return y < b.y;
	}
	bool operator>(const H& b) const {
		if (x != b.x) return x > b.x;
		return y > b.y;
	}
	bool operator==(const H& b) const { return x == b.x && y == b.y; }
	bool operator!=(const H& b) const { return (*this) != b; }
};
struct P {
	ll pos, cost;
	bool operator<(const P& b) const { return cost < b.cost; }
	bool operator>(const P& b) const { return cost > b.cost; }
};
struct B {
	ll to, cost;
};
struct E {
	ll from, to, cost;
	bool operator<(const E& b) const { return cost < b.cost; }
	bool operator>(const E& b) const { return cost > b.cost; }
};
template<typename T, typename U>
void chmin(T& a, U b) {
	if (a > b) a = b;
}
template<typename T, typename U>
void chmax(T& a, U b) {
	if (a < b) a = b;
}
template<typename T>
T max_0(T a) {
	if (a < 0) return 0;
	return a;
}
template<typename T>
T min_0(T a) {
	if (a > 0) return 0;
	return a;
}
ll read() {
	ll u;
	ll k = scanf("%lld", &u);
	return u;
}
ll gcd(ll i, ll j) {
	if (i > j) swap(i, j);
	if (i == 0) return j;
	return gcd(j % i, i);
}
ll mod_pow(ll x, ll n, ll p) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % p;
		x = x * x % p;
		n >>= 1;
	}
	return res;
}//x^n%p
ll bitcount(ll x) {
	int sum = 0;
	for (int i = 0; i < 20; i++)
		if ((1ll << i) & x) sum++;
	return sum;
}
/*ll fact_[200000];
ll comb(ll x, ll y, ll mod = Mod) {
	if (!fact_[0]) {
		fact_[0] = 1;
		for (int i = 1; i < 200000; i++) {
			fact_[i] = fact_[i - 1] * i % mod;
		}
	}
	if (x < y) return 0;
	return mod_pow(fact_[x], mod, mod) *
		mod_pow(fact_[x - y], mod - 2, mod) % mod *
		mod_pow(fact_[y], mod - 2, mod) % mod;
}//xCy*/
const ll Inf = 3023372036854775807;
const int inf = 1500000000;
#define int long long
//----------------------------------------------------
int n;
int a[200000];
vector<int>b;
int c[200000];
int dat[400000];
void add(int x, int y) {
	while (x <= 2 * n) {
		dat[x] += y;
		x += x & -x;
	}
}
int query(int x) {
	int sum = 0;
	while (x > 0) {
		sum += dat[x];
		x -= x & -x;
	}
	return sum;
}
int solve(int t) {
	for (int i = 1; i <= 2 * n; i++) dat[i] = 0;
	for (int i = 0; i < n; i++) {
		if (a[i] >= t + 1) c[i] = 1;
		else c[i] = -1;
	}
	int sum = 0, res = 0;
	//ここまでの和、答え
	for (int i = 0; i < n; i++) {
		sum += c[i];
		res += query(sum + n);
		res += (sum >= 0);
		add(sum + n, 1);
	}
	return res;
}
signed main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		b.push_back(a[i]);
	}
	sort(all(b));
	b.erase(unique(all(b)), b.end());
	for (int i = 0; i < n; i++) {
		a[i] = lower_bound(all(b), a[i]) - b.begin() + 1;
	}
	int ok = 0, ng = b.size(), mid;
	int g = ceil(((n + 1) * n / 2) / 2.);
	while (abs(ok - ng) > 1) {
		mid = (ok + ng) / 2;
		if (solve(mid) >= g) ok = mid;
		else ng = mid;
	}
	cout << b[ok] << endl;
}

Measured memory_bytes: 6772