#include <iostream>
#include <stdlib.h>
using namespace std;

int compare(const void* p1, const void* p2) {
    const int* n1 = (int*)p1;
    const int* n2 = (int*)p2;
    if (*n1 < *n2) {
        return -1;
    } else if (*n1 == *n2) {
        return 0;
    } else {
        return 1;
    }
}

int main(void) {
    int n;
    int list[1000] = {0};
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> list[i];
    }
    qsort(list, n, sizeof(int), compare);
    int mid = n/2;
    if (0 == (n % 2)) {
        cout << (list[mid-1] + list[mid])/2. << endl;
    } else {
        cout << list[mid] << endl;
    }
    return 0;
}