#include <bits/stdc++.h>
using namespace std;
const int N = 10005;
const int P = 1000000007;
const long long mod = P;
const int INF = 0x3f3f3f3f;
const long long LLINF = 0x3f3f3f3f3f3f3f3f;
const long double eps = 1e-8;
long long qmod(long long a, long long n, long long mod) {
  long long ans = 1;
  while (n) {
    assert(ans > 0);
    if (n & 1ll) ans = ans * a % mod;
    n >>= 1;
    a = a * a % mod;
  }
  return ans % mod;
}
int a[N];
int main() {
  int n;
  cin >> n;
  for (int i = (1); i <= (n); ++i) cin >> a[i];
  sort(a + 1, a + 1 + n);
  cout << a[(n + 1) >> 1] << endl;
  return 0;
}
