// Original C++ solution (slower):
#include<iostream>

#include<cstdio>

#include<math.h>

#include<algorithm>

#include<map>

#include<set>

#include<bitset>

#include<stack>

#include<queue>

#include<string>

#include<cstring>





using namespace std;

typedef long long LL;

const int maxn=2e6+7;

LL n;

LL tot=0;

LL mn=0x3f,mx=-0x3f;

LL a[maxn];

LL bit[maxn];



struct node {

LL val,pos;

}arr[maxn];



bool cmp(node n1,node n2)

{

    return n1.val==n2.val?n1.pos<n2.pos:n1.val<n2.val;

}



void update(LL x,LL val)

{

    for(; x< maxn ;x+=(x & -x))

    {

        bit[x]+=val;

    }

}



LL getsum(LL x)

{

    LL ans=0;

    for(;x>0;x-=(x & -x))

    {

        ans += bit[x];

    }

    return ans;

}







bool check(LL x){

    memset(bit,0,sizeof(bit));

     memset(arr,0,sizeof(arr));





	for(int i=1;i<=n;i++)

    {

        if(a[i]<=x)arr[i].val=-1;

        else arr[i].val=1;

        arr[i].pos=i+1;

    }



    arr[0].val=0;

	arr[0].pos=1;



	for(int i=1;i<=n;i++)

	arr[i].val+=arr[i-1].val;

	sort(arr,arr+n+1,cmp);



	LL ans=0;

	for(int i=0;i<=n;i++)

    {

        ans+=(i-getsum(arr[i].pos));

        update(arr[i].pos,1);

    }

	return ans*2 > tot;

}





int main(){

   scanf("%lld",&n);



   for(int i=1;i<=n;i++)

    {

   	 scanf("%lld",&a[i]);

   	 mn=min(mn,a[i]);

   	 mx=max(mx,a[i]);

   	 tot+=i;

   }



   LL l=mn,r=mx;

   while(r-l>1)

    {

   	  LL mid=(l+r)/2;

   	 if(check(mid)) r=mid;

   	 else l=mid;

   	 //printf("s%d",mid);

   }

   printf("%lld\n",r);



   return 0;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>

#include<algorithm>

using namespace std;

#define fo(i,a,b) for(int i=a;i<=b;i++)

#define fd(i,a,b) for(int i=a;i>=b;i--)

int n,a[110000],l,r,mi,f[220000];

long long m;

inline void add(int x){

	while (x<=n+n){

		f[x]++;

		x+=x&(-x);

	}

}

inline long long ask(int x){

	long long ans=0;

	while (x){

		ans+=f[x];

		x-=x&(-x);

	}

	return ans;

}

inline bool che(int x){

	int s=n+1;long long ans=0;//s=n TLE

	fo(i,0,n+n) f[i]=0;

	add(s);

	fo(i,1,n){

		if (a[i]>=x) s++;else s--;

		ans+=ask(s);

		add(s);

	}

	return ans>=m;

}

int main(){

	scanf("%d",&n);

	fo(i,1,n) scanf("%d",&a[i]);

	m=n*1ll*(n+1)/2;

	m=(m+1)/2;

	l=0x7fffffff;r=0;

	fo(i,1,n){

		if (a[i]<l) l=a[i];

		if (a[i]>r) r=a[i];

	}

	l--;r++;

	while (l+3<r){

		mi=(l+r)>>1;

		if (che(mi)) l=mi+1;else r=mi-1;

	}

	fd(i,r+1,l-1) if (che(i)){//che(mi)!!!

		printf("%d\n",i);

		return 0;

	}

	return 0;

}

// Fastest known solution for this problem:
#define _USE_MATH_DEFINES



#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <iostream>

#include <cmath>

#include <algorithm>

#include <vector>

#include <queue>

#include <map>

#include <list>

#include <stack>



using namespace std;



typedef pair<long long int, long long int> P;



long long int INF = 1e18;

long long int MOD = 1e9 + 7;



long long int N, sz = 150000;

long long int A[110000];

bool flag[110000];

long long int BIT[210000];



void add(int a, long long int w){

	

	// a番目の要素にwを足す O(log N)

	

	for(int x = a; x <= sz; x += x & -x){

		BIT[x] += w;

	}

}



long long int sum(int a){

	

	// 1からaまでの要素の合計を返す O(log N)

	

	long long int ret = 0;

	for(int x = a; x > 0; x -= x & -x){

		ret += BIT[x];

	}

	return ret;

}



void init(){

	for(int i = 0; i < sz; i++){

		BIT[i] = 0;

	}

}



bool check(long long int min_A){

	for(int i = 0; i < N; i++){

		flag[i] = (A[i] >= min_A);

	}

	vector<P> v;

	long long int cnt = 0, S = 0;

	v.push_back(make_pair(0, 1));

	for(int i = 0; i < N; i++){

		if(flag[i]){

			S += 1;

		}else{

			S -= 1;

		}

		v.push_back(make_pair(S, i + 2));

	}

	sort(v.begin(), v.end());

	init();

	for(int i = 0; i < v.size(); i++){

		cnt += sum(v[i].second);

		add(v[i].second, 1);

	}

	//cout << min_A << " " << cnt << endl;

	return cnt >= (N * (N + 1) / 2 + 1) / 2;

}



long long int bin_search(long long int lef, long long int rig){

	long long int middle = (lef + rig) / 2;

	//cout << middle << " ";

	if(rig - lef <= 1){

		if(check(rig)){

			return rig;

		}else{

			return lef;

		}

	}

	if(check(middle)){

		lef = middle;

	}else{

		rig = middle;

	}

	return bin_search(lef, rig);

}



int main(){

	

	cin >> N;

	

	for(int i = 0; i < N; i++){

		cin >> A[i];

	}

	

	cout << bin_search(0, 1e10) << endl;

	

	return 0;

}