using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<long, long>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    bool calc(int u, int[] A, long sum)
    {
        int N = A.Length;
        var S = new int[N + 1];

        for (int i = 0; i < N; i++)
        {
            S[i + 1] = S[i] + (A[i] < u ? -1 : 1);
        }

        return merge_count(S) <= sum;
    }
    void solve()
    {
        int N = cin.nextint;
        var A = cin.scanint;
        var sum = (long)(N + 1) * N / 2 / 2;
        int ok = A.Min();
        int ng = A.Max() + 1;

        while (ng - ok > 1)
        {
            int mid = (ok + ng) / 2;

            //WriteLine($"{ok} {ng} {mid}");
            if (calc(mid, A, sum))
            {
                ok = mid;
            }
            else
            {
                ng = mid;
            }
        }

        WriteLine(ok);
    }

    long merge_count(int[] A)
    {
        int n = A.Length;
        if (n <= 1) return 0;

        long cnt = 0;
        int m = n >> 1;
        var B = new int[m];
        var C = new int[n - m];
        for (int i = 0; i < B.Length; i++)
        {
            B[i] = A[i];
        }
        for (int i = 0; i < C.Length; i++)
        {
            C[i] = A[i + m];
        }

        cnt += merge_count(B);
        cnt += merge_count(C);

        int ai = 0, bi = 0, ci = 0;
        while (ai < n)
        {
            if (bi < B.Length && (ci == C.Length || B[bi] <= C[ci]))
            {
                A[ai++] = B[bi++];
            }
            else
            {
                cnt += (n >> 1) - bi;
                A[ai++] = C[ci++];
            }
        }
        return cnt;
    }
}

static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }
    public static void ForEach<T>(this T[] array, Action<T> action) => Array.ForEach(array, action);

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}


Measured memory_bytes: 39928