#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define ll long long
using namespace std;
ll input[200005];
ll n;
ll  l,r,ans,mid;
ll  lib[200005];
ll sum[200005];
ll  tree[200005];
inline ll lowbit(ll x) {
	return x&(-x);
	}
ll minn=0;
ll maxx=0;
void add(ll x) {
	for(ll i=x; i<=maxx; i+=lowbit(i))tree[i]+=1;
	}
ll summ(ll x) {
	ll kk=0;
	for(ll i=x; i; i-=lowbit(i))kk+=tree[i];
	return kk;
	}
bool check(ll x) {
	memset(tree,0,sizeof(tree));
	ll anss=0;
	minn=0;
	maxx=0;
	for(ll i=1; i<=n; i++) {
		if(input[i]>=x)sum[i]=1;
		else sum[i]=-1;
		}
	for(ll i=1; i<=n; i++)
		sum[i]+=sum[i-1],minn=min(minn,sum[i]);
	for(ll i=0; i<=n; i++)
		sum[i]=sum[i]-minn+1,maxx=max(maxx,sum[i]);
	for(ll i=0; i<=n; i++) {
		anss+=summ(sum[i]);
		add(sum[i]);
		}
	return anss>=n*(n+1)/4;
	}
int main() {
	scanf("%lld",&n);
	r=0;
	for(ll i=1; i<=n; i++) {
		scanf("%lld",&input[i]);
		r=max(r,input[i]);
		}
	l=1;
	while(l<=r) {
		mid=(l+r)>>1;
		if(check(mid)) {
			ans=mid;
			l=mid+1;
			}
		else r=mid-1;
		}
	cout<<ans;
	}
