#include <bits/stdc++.h>
using namespace std;
template <typename T>
T sum(T a) {
  T res = 0;
  for (T i = 1; i <= a; i++) {
    res += i;
  }
  return res;
}
template <typename T>
void selectSort(T arr[], int len) {
  for (int i = 0; i < len; i++) {
    int minIndex = i;
    for (int j = i + 1; j < len; j++)
      minIndex = arr[minIndex] > arr[j] ? j : minIndex;
    swap(arr[i], arr[minIndex]);
  }
}
template <typename T>
void insertSort(T arr[], int len) {
  for (int i = 0; i < len; i++) {
    T a = arr[i];
    int j;
    for (j = i; j > 0 && a < arr[j - 1]; j--) arr[j] = arr[j - 1];
    arr[j] = a;
  }
}
template <typename T>
void insertSort(int arr[], int _arr[], int len) {
  for (int i = 0; i < len; i++) {
    T a = arr[i], b = _arr[i];
    int j;
    for (j = i; j > 0 && a < arr[j - 1]; j--) {
      arr[j] = arr[j - 1];
      _arr[j] = _arr[j - 1];
    }
    arr[j] = a;
    _arr[j] = b;
  }
}
template <typename T>
void mergeSort(T arr[], int len) {}
int main() {
  int n;
  cin >> n;
  int s[n];
  for (int i = 0; i < n; i++) cin >> s[i];
  insertSort(s, n);
  cout << s[n / 2 + n % 2 - 1];
  return 0;
}
