#include<bits/stdc++.h>
#define N 3011
using namespace std;
int n,a[N],b[N][N],pre[N],tot;
bool check(int mid)
{
    for (int i=1;i<=n;i++)
    {
        pre[i]=0;
        for (int j=1;j<=n;j++)b[i][j]=0;
    }
    for (int i=1;i<=n;i++)pre[i]=pre[i-1]+(a[i]>=mid);

    for (int i=1;i<=n;i++)
        for (int j=i;j<=n;j++)
        if((pre[j]-pre[i-1])*2>=(j-i+2))b[i][j]=1;
    for (int i=1;i<=n;i++)
        for (int j=i+1;j<=n;j++)
            b[i][j]+=b[i][j-1];
    for (int j=n;j>=1;j--)
        for (int i=j-1;i>=1;i--)
            b[i][j]+=b[i+1][j];
    tot=0;
    for(int i=1;i<=n;i++)
        for(int j=i;j<=n;j++)
                if(2*b[i][j]>=(j-i+1)*(j-i+2)/2)tot++;
    return 2*tot>n*(n+1)/2;
}
void solve()
{
    cin>>n;
    int l=1e9,r=0,ans=0;
    for(int i=1;i<=n;i++)cin>>a[i],l=min(l,a[i]),r=max(r,a[i]);
   
    while(l<=r)
    {
        int mid=l+r>>1;
        if(check(mid))
        {
            l=mid+1;
            ans=mid;
        }
        else r=mid-1;
    }
    cout<<ans<<endl;
    return ;
}
int main()
{
    int T=1;
    while(T--)solve();
    return 0;
}