#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#define all(x) x.begin(),x.end()
#define pb push_back
#define ll long long 
#define P pair<int,int>
#define LP pair<ll,ll>
using namespace std;
int main() {
	int n;
	cin >>n;
	vector<double> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(a.begin(), a.end());
	if (n % 2 == 0) cout << (a[n / 2] + a[n / 2 - 1]) / 2 << endl;
	else cout << a[(n - 1) / 2] << endl;
	
	return 0;
}