#include <bits/stdc++.h>
using namespace std;
const long long inf = LONG_MAX;
const long long arr = 1000000;
long long n, m;
long long a[arr];
vector<pair<long long, long long> > v;
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
  if (a.first == b.first)
    return a.second < b.second;
  else
    return a.first < b.first;
}
int main(void) {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  if (n % 2 != 0) return cout << a[n / 2] << '\n', 0;
  if (n % 2 == 0) return cout << a[(n - 1) / 2] << '\n', 0;
  return 0;
}
