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