#ifndef __BIT_H__
#define __BIT_H__

#include <vector>

class BinaryIndexedTree {
	using T = long long;

private:
	const int size_m;
	std::vector<T> arr_m;

	static const int DEFAULT = -1;
public:
	BinaryIndexedTree(int size);
	void Add(int pos, T increment);
	T Sum(int right) const;
	T Sum(int left, int right) const;
	T Get(int pos) const;

	void Debug(int size = DEFAULT) const;
};

#endif

#ifdef ONLY_MY_ENVIR
#include "BIT.h"
#endif

#include <cassert>
#include <iostream>

/* 長さ size の BIT を作成 */
BinaryIndexedTree::BinaryIndexedTree(int size)
	: size_m(size), arr_m(size + 1) {
}

/* pos 番目の要素を increment 増加させる */
void BinaryIndexedTree::Add(int pos, T increment) {
	++pos;
	for (int i = pos; i <= size_m; i += i & -i) {
		arr_m[i] += increment;
	}
}

/* [0, right) に存在する全要素の和をとる */
BinaryIndexedTree::T BinaryIndexedTree::Sum(int right) const {
	T sum = T();
	for (int i = right; i > 0; i -= i & -i) {
		sum += arr_m[i];
	}
	return sum;
}

/* [left, right) に存在する全要素の和をとる */
BinaryIndexedTree::T BinaryIndexedTree::Sum(int left, int right) const {
	assert(left <= right);

	return Sum(right) - Sum(left);
}

/* pos 番目の要素を直接取得 */
BinaryIndexedTree::T BinaryIndexedTree::Get(int pos) const {
	++pos;
	return arr_m[pos];
}


/* デバッグ出力用; size = -1 とすると全要素出力 */
void BinaryIndexedTree::Debug(int size) const {
	if (size == DEFAULT) {			// デフォルト値への対処
		size = size_m;
	}

	if (size > size_m) {
		size = size_m;
	}

	std::cout << "{ ";
	for (int i = 1; i <= size; ++i) {
		std::cout << arr_m[i] << ' ';
	}
	std::cout << "}" << std::endl;
}

#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>

using namespace std;
typedef unsigned int uint;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;
#define REP(i, a, n) for(LL i = (a), i##_max = (n); i < i##_max; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##min = (a); i >= i##min; --i)
#define ALL(arr) (arr).begin(), (arr).end()
#define FLOAT fixed << setprecision(16)
#define SPEEDUP {cin.tie(NULL); ios::sync_with_stdio(false);}
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const string INFSTR = "\x7f";
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U>
ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N>
void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template<class T>
T Compare(T left, T right) { return left > right ? 1 : (left < right ? -1 : 0); }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }
template <class T>
T Next() { T buf; cin >> buf; return buf; }

#ifdef ONLY_MY_ENVIR
#include "IntMod.h"
#include "Union_Find.h"
#include "Graph.h"
#include "Range.h"
#include "Global.h"
#include "Flow_Solver.h"
#include "Tree.h"
#include "Suffix_Array.h"
#include "Geometry.h"
#include "Matrix.h"
#include "Segment_Tree.h"
#include "BIT.h"
#include "Rational.h"
#include "Position.h"
#include "Factorization.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>> (istream& ist, __int128& val) { LL tmp;  ist >> tmp; val = tmp; return ist; }
ostream& operator<< (ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

#if 1234567891
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>
template<typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >;	// コスト小を優先
template <class T>
auto Is(const T& value) { return [value](const auto& comparand) -> bool { return comparand == value; }; }
#endif




int N, K;
int A[100000];

// p 以上の区間が半分以上ある
int M[100000];

bool OK(int p) {
	M[0] = 0;
	REP(i, 0, N) {
		M[i + 1] = (A[i] >= p ? 1 : -1);
	}

	partial_sum(M, M + N + 1, M);
	BinaryIndexedTree bit(1 << 18);

	LL sum = 0;
	const int bias = 100000;
	REP(i, 0, N + 1) {
		sum += bit.Sum(0, bias + M[i] + 1);
		bit.Add(bias + M[i], 1);
	}
	return sum * 2 >= (LL)(N + 1) * N / 2;
}

int main() {
	cin >> N;
	REP(i, 0, N) {
		cin >> A[i];
	}

	int lo = 0;
	int hi = INF;
	while (hi - lo > 1) {
		int mid = (lo + hi) / 2;
		if (OK(mid)) {
			lo = mid;
		} else {
			hi = mid;
		}
	}
	cout << lo << endl;
	return 0;
}


Measured memory_bytes: 3072