#include <bits/stdc++.h>
int a[101];
void quicksort(int l, int r) {
  int i, j, t, temp;
  if (l > r) return;
  temp = a[l];
  i = l;
  j = r;
  while (i != j) {
    while (a[j] >= temp && i < j) j--;
    while (a[i] <= temp && i < j) i++;
    if (i < j) {
      t = a[i];
      a[i] = a[j];
      a[j] = t;
    }
  }
  a[l] = a[i];
  a[i] = temp;
  quicksort(l, i - 1);
  quicksort(i + 1, r);
  return;
}
int main() {
  int n;
  while (~scanf("%d", &n)) {
    memset(a, 0, sizeof(a));
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    quicksort(1, n);
    printf("%d\n", a[(1 + n) / 2]);
  }
}
