#include <bits/stdc++.h>
using namespace std;
int n, a[1010];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  int head = 1, tail = n;
  for (int i = 1; i <= n - 1; i++) {
    if (i % 2 == 1)
      tail--;
    else
      head++;
  }
  cout << a[head] << endl;
  return 0;
}
