#include <bits/stdc++.h>
using namespace std;
const long long N = 1005;
int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, 1, -1};
int n, a[N], l, r, moves, cur;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < (n); ++i) {
    scanf("%d", a + i);
  }
  sort(a, a + n);
  printf("%d\n", a[(n - 1) / 2]);
}
