#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
	int n;
	cin >> n;

	vector<int> nums(n);
	for (int i = 0; i < n; i++) {
		cin >> nums[i];
	}
	sort(nums.begin(), nums.end());

	if (nums.size() % 2 == 0) {
		int med = nums[nums.size() / 2] + nums[nums.size() / 2 - 1];
		cout << (double)med / 2 << endl;
	}
	else {
		cout << nums[nums.size() / 2] << endl;
	}
	
	return 0;
}