#include <bits/stdc++.h>
using namespace std;
int n, m, t, v[300000 + 5];
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int valid(int i, int j) {
  if (i >= 1 && i <= 8 && j >= 1 && j <= 8)
    return 1;
  else
    return 0;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> v[i];
  sort(v, v + n);
  cout << v[(n + 1) / 2 - 1];
}
