#include<bits/stdc++.h>
#define N (n+n+1)
#define lowbit(x) (x&(-x))
using namespace std;
int n;
int a[300005];
int b[300005];
int c[600005];
void add(int x){
	while(x<=N){
		c[x]++;
		x+=lowbit(x);
	}
}
int query(int x){
	int sum=0;
	while(x){
		sum+=c[x];
		x-=lowbit(x);
	}
	return sum;
}
bool check(int x){
	b[0]=n+1;
	memset(c,0,sizeof(c));
	for(int i=1;i<=n;i++)b[i]=b[i-1]+(a[i]>x?-1:1);
	long long tot=0;
	for(int i=0;i<=n;i++){
		tot+=query(b[i]);
		add(b[i]);
	}
	return tot>=(1LL*n*(n+1)/2+1)/2;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	int L=0,R=1e9+5,ans=1e9+5;
	while(L<=R){
		int mid=(L+R)/2;
		if(check(mid))R=mid-1,ans=mid;
		else L=mid+1;
	}
	printf("%d",ans);
	return 0;
}