using System;
using System.Linq;
using System.Collections.Generic;

namespace Contest
{
    class Program
    {
        static void Main(string[] args)
        {
            ABC107.D();
        }
        
        class ABC107
        {
            public static void A()
            {
                Console.WriteLine(Read.Int() - Read.Int() + 1);
            }
            public static void B()
            {
                var H = Read.Int();
                var W = Read.Int();
                bool[,] A = new bool[H, W];
                for(int i = 0; i < H; ++i)
                {
                    var str = Read.Str();
                    for(int j = 0; j < W; ++j)
                    {
                        A[i, j] = str[j] == '#';
                    }
                }
                var raws = Enumerable.Range(0, H).Where(i => Enumerable.Range(0, W).Any(j => A[i, j])).ToArray();
                var cols = Enumerable.Range(0, W).Where(j => Enumerable.Range(0, H).Any(i => A[i, j])).ToArray();
                foreach(var raw in raws)
                {
                    Console.WriteLine(String.Join("", cols.Select(j => A[raw, j] ? "#" : ".")));
                }
            }
            public static void C()
            {
                var N = Read.Int();
                var K = Read.Int();
                var X = Read.LongN();
                Console.WriteLine(Enumerable.Range(0, N - K + 1).Select(i => X[i + K - 1] - X[i] + Math.Min(Math.Abs(X[i]), Math.Abs(X[i + K - 1]))).Min());
            }
            public static void D()
            {
                var N = Read.Long();
                var A = Read.LongN();
                long min = A.Min();
                long max = A.Max() + 1;
                long hurdle = (N * (N + 1) / 2 + 1) / 2;
                while (min + 1 < max)
                {
                    var mid = (min + max) / 2;
                    var count = D_Median(A, mid);
                    if (count < hurdle)
                    {
                        max = mid;
                    }
                    else
                    {
                        min = mid;
                    }
                }
                Console.WriteLine(min);
            }
            static long D_Median(long[] A, long x)
            {
                var B = new int[A.Length + 1];
                for(int i = 0; i < A.Length; ++i)
                {
                    B[i + 1] = B[i] + (A[i] >= x ? 1 : -1);
                }
                return ((long)A.Length * (A.Length + 1) / 2) - Util.CountInversion_Naive(B);
            }
        }

        class Util
        {
            public static long CountInversion_Naive(int[] array)
            {
                var min = array.Min();
                var max = array.Max();
                var bit = new BIT(max - min + 1);
                long count = 0;
                for (int i = 0; i < array.Length; ++i)
                {
                    var v = array[i] - min + 1;
                    bit.Add(v, 1);
                    count += i + 1 - bit.Sum(v);
                }
                return count;
            }
            public class BIT
            {
                int N; long[] array;
                public BIT(int m) { for (int n = 1; ; n *= 2) { if (n >= m) { N = n; array = new long[N + 1]; break; } } }
                public void Add(int idx, int v) { for (int x = idx; x <= N; x += x & -x) { array[x] += v; } }
                public long Sum(int idx) { long ret = 0; for (int x = idx; x > 0; x -= x & -x) { ret += array[x]; } return ret; }
            }
        }

        static class Read
        {
            static Queue<string> queue = new Queue<string>();
            static void Enqueue() { var ss = Console.ReadLine().Split(' '); foreach (var s in ss) { queue.Enqueue(s); } }
            public static int Int() { if (queue.Count == 0) { Enqueue(); } return Convert.ToInt32(queue.Dequeue()); }
            public static long Long() { if (queue.Count == 0) { Enqueue(); } return Convert.ToInt64(queue.Dequeue()); }
            public static string Str() { if (queue.Count == 0) { Enqueue(); } return queue.Dequeue(); }
            public static int[] IntN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToInt32(s)).ToArray(); }
            public static long[] LongN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToInt64(s)).ToArray(); }
            public static string[] StrN() { return Console.ReadLine().Split(' '); }
            public static Tuple<int, int>[] TupleInt(int n) { List<Tuple<int, int>> list = new List<Tuple<int, int>>(); for (int i = 0; i < n; ++i) { var ab = Read.IntN(); list.Add(new Tuple<int, int>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<long, long>[] TupleLong(int n) { List<Tuple<long, long>> list = new List<Tuple<long, long>>(); for (int i = 0; i < n; ++i) { var ab = Read.LongN(); list.Add(new Tuple<long, long>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<string, string>[] TupleStr(int n) { List<Tuple<string, string>> list = new List<Tuple<string, string>>(); for (int i = 0; i < n; ++i) { var ab = Read.StrN(); list.Add(new Tuple<string, string>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<double, double>[] TupleDouble(int n) { List<Tuple<double, double>> list = new List<Tuple<double, double>>(); for (int i = 0; i < n; ++i) { var ab = Read.LongN(); list.Add(new Tuple<double, double>(ab[0], ab[1])); } return list.ToArray(); }
            public static long[,] LongMatrix(int r, int c)
            {
                var mat = new long[r, c];
                for (int i = 0; i < r; ++i)
                {
                    var x = Read.LongN();
                    for (int j = 0; j < c; ++j)
                    {
                        mat[i, j] = x[j];
                    }
                }
                return mat;
            }
            public static Dictionary<int, HashSet<int>> AdjacencyList(int N, int M)
            {
                Dictionary<int, HashSet<int>> dict = new Dictionary<int, HashSet<int>>();
                for (int i = 0; i <= N; ++i)
                {
                    dict.Add(i, new HashSet<int>());
                }
                for (int i = 0; i < M; ++i)
                {
                    var ab = Read.IntN();
                    dict[ab[0]].Add(ab[1]);
                    dict[ab[1]].Add(ab[0]);
                }
                return dict;
            }
        }
    }
}


Measured memory_bytes: 33756