#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <vector>
#define itn int
#define reaD read
typedef long long ll;
#define N 100005
using namespace std;

ll n, a[N], l, r, t[N << 1], sum[N]; 

inline int read()
{
	int x = 0, w = 1; char c = getchar();
	while(c < '0' || c > '9') { if (c == '-') w = -1; c = getchar(); }
	while(c >= '0' && c <= '9') { x = x * 10 + c - '0'; c = getchar(); }
	return x * w;
}

int lowbit(int x) { return x & (-x); }

void add(int x, long long y) { for(int i = x; i <= 200000; i += lowbit(i)) t[i] += y; }

long long query(int x) { long long res = 0; for(int i = x; i; i -= lowbit(i)) res += t[i]; return res; }

bool check(long long mid)
{
	memset(t, 0, sizeof(t));
	long long cnt = 0;
	for(int i = 1; i <= n; i++) sum[i] = sum[i - 1] + (a[i] >= mid ? 1 : -1);
	for(int i = 0; i <= n; i++)
	{
		cnt += query(sum[i] + 100000);
		add(sum[i] + 100000, 1); 
	}
	return cnt >= 1ll * n * (n + 1) / 4; 
}

int main()
{
	n = read();
	for(int i = 1; i <= n; i++) r = max(r, a[i] = read());
	while(l <= r)
	{
		int mid = (l + r) >> 1;
		if(check(mid)) l = mid + 1;
		else r = mid - 1; 
	}
	printf("%lld\n", r); 
	return 0;
}