#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vector1;
int inputNum;
while (cin >> inputNum) {
vector1.push_back(inputNum);
if (cin.get() == '\n')
break;
}
// 排序
sort(vector1.begin(), vector1.end());
// 判断输入个数是奇偶
double insertedNum;
if (n % 2 == 0) { //偶数
int first = n / 2 - 1;
int second = n / 2;
insertedNum = (double)(vector1[first] + vector1[second]) / 2.0;
} else { //奇数
insertedNum = vector1[n / 2];
}
cout << insertedNum << endl;
return 0;
}