#include <stdio.h>

void Quicksort(int data[], int left, int right){
    int l = left, r = right;
    int pivot = data[(left + right) / 2];
    int temp;

    while(1){
        while (data[l] < pivot) l++;
        while (pivot < data[r]) r--;
        if(r < l) break;

        temp = data[l];
        data[l] = data[r];
        data[r] = temp;

        l++, r--;
    }
    if(left < r)  Quicksort(data, left, r);
    if(l < right) Quicksort(data, l, right);
}

int main(void){
    int i, N;
    scanf("%d", &N);
    int a[N], m = (N-1)/2;
    for(i=0;i<N;i++){
        scanf("%d", &a[i]);
    }
    Quicksort(a, 0, N-1);
    if(N%2){
        printf("%d\n", a[m]);
    }else{
        printf("%.1f\n", (a[m]+a[m+1])/2.0);
    }
    return 0;
}