#include <cstdio>
#include <algorithm>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;

int main() {
    int n;
    scanf("%d", &n);
    int A[n];
    REP(i,n) scanf("%d", &A[i]);
    sort(A, A+n);
    if (n%2) {
        printf("%d\n", A[n/2]);
    } else {
        printf("%f\n", (A[n/2-1]+A[n/2])/2.0);
    }
}