import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}
void readA(T)(size_t n,ref T[]t){t=new T[](n);auto r=rdsp;foreach(ref v;t)pick(r,v);}

void main()
{
  int n; readV(n);
  int[] a; readA(n, a);

  auto mi = a.reduce!min, ma = a.reduce!max;
  auto t = (n.to!long*(n+1)/2+1)/2;

  auto calc(int x)
  {
    auto b = a.map!(ai => ai >= x ? +1 : -1).array;
    auto s = new int[](n+1);
    foreach (i; 0..n) s[i+1] = s[i] + b[i];

    auto ft = new FenwickTree!int(n*2+1), ans = 0L;
    foreach (i; 0..n+1) {
      ans += ft[0..s[i]+n+1];
      ++ft[s[i]+n];
    }

    return ans < t;
  }

  auto bs = iota(mi, ma+1).map!(x => tuple(x, calc(x))).assumeSorted!"a[1]<b[1]";
  writeln(bs.lowerBound(tuple(0, true)).back[0]);
}

class FenwickTree(T)
{
  const size_t n;
  T[] buf;

  this(size_t n)
  {
    this.n = n;
    this.buf = new T[](n+1);
  }

  void opIndexOpAssign(string op)(T val, size_t i) if (op == "+" || op == "-")
  {
    ++i;
    for (; i <= n; i += i & -i) mixin("buf[i] " ~ op ~ "= val;");
  }

  void opIndexUnary(string op)(size_t i) if (op == "++" || op == "--")
  {
    ++i;
    for (; i <= n; i += i & -i) mixin("buf[i]" ~ op ~ ";");
  }

  pure T opSlice(size_t r, size_t l) { return get(l) - get(r); }
  pure T opIndex(size_t i) { return opSlice(i, i+1); }
  pure size_t opDollar() { return n; }

private:

  pure T get(size_t i)
  {
    auto s = T(0);
    for (; i > 0; i -= i & -i) s += buf[i];
    return s;
  }
}
