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

int main()
{
	int N;
	std::vector<int> v;
	int n,w=0;

	std::cin >> N;

	while(N--){
		std::cin >> n;
		v.push_back(n);
	}

	std::sort(v.begin(),v.end());
	for(std::vector<int>::iterator i = v.begin();i != v.end()-2;){
		//for(int j = 0;j < v.size();j++) std::cout << v[j] << ' ';
		//std::cout << std::endl;
		*(i+v.size()-1) += *(i + v.size()/2)/2;
		if(v.size() > 2) v.erase(i+v.size()/2);
		else break;
	}
	//std::cout << v.size() << std::endl;
	std::cout << v[0]/2 + v[1] << std::endl;
	return 0;
}