#include <bits/stdc++.h>

#define ll long long
#define mx  200005
#define mod 1000000009
#define lim 10000000
#define inf 2000000000
#define N 18
#define eps 100000
using namespace std;
int fre[mx],sum[mx],a[mx];
ll n;

ll getCount(int x)
{
	memset(fre,0,sizeof(fre));

	sum[0]=0;
	for(int i=1;i<=n;i++)
	{
		if(a[i]>=x)sum[i]=sum[i-1]+1;
		else sum[i]=sum[i-1]-1;
	}

	fre[eps]=1;
	int pre=0;
	ll ans=0;

	for(int i=1;i<=n;i++)
	{
		if(sum[i]>sum[i-1])pre+=fre[sum[i]+eps]+1;
		else pre=pre-fre[sum[i-1]+eps]+1;
		fre[sum[i]+eps]++;
		ans+=1LL*pre;
	}
	return ans;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin>>n;
	ll req=n*(n+1)/2;
	req=ceil(req/2);
	vector<int>v;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		v.push_back(a[i]);
	}
	sort(v.begin(),v.end());
	v.erase(unique(v.begin(),v.end()),v.end());
	int lo=0,hi=v.size()-1;

	for(int i=1;i<=30;i++)
	{
		int mid=(lo+hi+1)/2;
		if(getCount(v[mid])>=req)
			lo=mid;
		else
			hi=mid-1;
	}

	cout<<v[lo]<<"\n";
	return 0;
}
