#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int N = (int)2e5 + 10;
const int M = (int)1e3 + 4;
const int INF = (int)0x3f3f3f3f;
const double ESP = 1e77;
const long long MOD = 1e9 + 7;
vector<long long> vec;
long long element(0);
int n(0);
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> element;
    vec.push_back(element);
  }
  sort(vec.begin(), vec.end());
  cout << vec[(n - 1) / 2];
  return 0;
}
