/*
Like it man!

*/
#include<bits/stdc++.h>
using namespace std;

typedef long long lld;


int main()
{

	lld n;
	cin >> n;
	vector<lld > v(n);
	for (lld i = 0;i < n;i++)
	{
		cin >> v[i];
	}

	sort(v.rbegin(), v.rend());

	lld ans = 0;
	for (lld i = 0;i < n;i++)
	{

		ans += (v[i] * pow(2,i));

	}
	cout << ans << "\n";


}