#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {

	int n=0;
	cin>>n;

	vector<double> p;

	double tmp=0;
	for(int i=0; i<n; i++){
		cin>>tmp;
		p.push_back(tmp);
	}

	sort(p.begin(),p.end());

	int s = n/2;
	int a = n%2;

	if(a == 0){
		cout<<(p[s-1]+p[s])/2<<endl;
	}else {
		cout<<p[s+a-1]<<endl;
	}

	return 0;
}