#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;
	cin >> n;
	multiset<int> a;
	long long sum = 0;
	int temp = 0;
	for (int i = 0; i < n; i++)
	{
		cin >> temp;
		a.insert(temp);
	}
	multiset<int>::iterator it2 = a.begin();
	int i = n-1;
	while (it2 != a.end())
	{
		sum += (*it2 * pow(2, i));
		++it2;
		i--;
	}
	cout << sum << endl;
	return 0;
}