#include<stdio.h>
void sort(int nums[], int len);
int main(void){
	int a[1000], n, i, j;
	double median;
	scanf("%d", &n);
	for(i = 0 ; i < n ; i++){
		scanf("%d", &a[i]);
	}
	sort(a, n);
	if(n%2 == 0){
		median = (double)(a[n/2-1] + a[n/2]) / 2;
		printf("%.1lf\n", median);
	}else{
		median = a[n/2];
		printf("%.0lf\n", median);
	}
	return 0;
}

void sort(int nums[], int len){
	int k, l, tmp;
	for(k = 0 ; k < len-1 ; k++){
		for(l = k+1 ; l < len ; l++){
			if(nums[k] > nums[l]){
				tmp = nums[l];
				nums[l] = nums[k];
				nums[k] = tmp;
			}
		}
	}		
}