#include<stdio.h>
#include<ctype.h>
#include<string.h>
#include<algorithm>
#define il inline
#define rg register
#define lowbit(x) (x&(-x))
using namespace std;
typedef long long ll;
const int O=100010;
il int gi(){
	rg int o=0,fl=1;char ch=getchar();
	while(!isdigit(ch)&&ch!='-')ch=getchar();
	if(ch=='-')fl=-1,ch=getchar();
	while(isdigit(ch))o=o*10+ch-'0',ch=getchar();
	return o*fl;
}
ll n,a[O],tree[O<<1],sum[O],l=0x3f3f3f3f,r,ans;
il void add(int x,ll v){
	for(;x<=2e5;x+=lowbit(x))tree[x]+=v;
}
il int query(int x){
	int tot=0;
	for(;x;x-=lowbit(x))tot+=tree[x];
	return tot;
}
il bool check(int x){
	memset(tree,0,sizeof(tree));
	ans=0;
	for(int i=1;i<=n;++i)
		sum[i]=sum[i-1]+(a[i]>=x?1:-1);
	for(int i=0;i<=n;++i){
		ans+=query(sum[i]+O);
		add(sum[i]+O,1ll);
	}
	return ans>=n*(n+1)>>2;
}
int main( ){
	n=gi();
	for(int i=1;i<=n;++i){
		a[i]=gi();
		l=min(l,a[i]);
		r=max(r,a[i]);
	}
#define mid (l+r>>1)
	while(l<=r)
		if(check(mid))l=mid+1;
		else r=mid-1;
#undef mid
	printf("%lld\n",r);
	return 0;
}
