#include <bits/stdc++.h>
using namespace std;

const int maxn = 3e5 + 10;

int n;
int a[maxn];
vector<pair<int, int> > ans;

int main() {
	cin >> n;
	for (int i = 1;i <= n;++i) {
		cin >> a[i];
	}
	sort(a + 1, a + 1 + n);
	int sum = 0;
	for (int i = 1;i <= n;++i) {
		ans.push_back(make_pair(a[i], (min(n - i, i - 1) * 2 + 2)));
		sum += ans.back().second;
	}
	sort(ans.begin(), ans.end());
	
	int mid = ((sum) + 1) / 2;
	for (int i = 1;i <= n;++i) {
		mid -= ans[i].second;
		if (mid < 0) {
			cout << ans[i].first << endl;
			return 0;
		}
	}
	return 0;
}