#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>

using namespace std;


int main() {
	int i, j, k;
	int n;
	vector<long>x;

	cin >> n;


	for (i = 0; i < n; i++) {
		long num;
		cin >> num;
		x.push_back(num);
	}
	
	sort(x.begin(), x.end());
	long num = 0;

	for (i = 0; i < n - 1; i++) {
		/*
		if (i == 0) {
			num += x[i + 1] + x[i] / 2;
			i++;
			continue;
		}*/

		/*
		if (num < x[i]) {
			x[i] += num / 2;
			num = x[i];
		}
		else if (num > x[i]) {
			num += x[i] / 2;
		}*/

		x[n - 1] += x[i] / 2;

		num = x[n - 1];
	}


	cout << num << endl;






	getchar();
	getchar();
	return 0;
}