#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

int main() {
	int n, j;
	unsigned long int sum_cal, pow;

	//int count;

	cin >> n;
	vector<int> calories(n);
	for (int calories_i = 0; calories_i < n; calories_i++) {
		cin >> calories[calories_i];
	}

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

	sum_cal = 0;
	//count = 0;
	pow = 1;
	for (j = n - 1; j >= 0; j--)
	{
		sum_cal += calories[j] * pow;
		pow <<= 1;
	}
	
	cout << sum_cal;
	return 0;
}