#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
	int n;
	cin>>n;
	vector <int> A;
	A.resize(n);
	for (int k=0;k<n;k++)
	cin>>A[k];
	sort(A.begin(),A.end());
	long long sum=0;
	for (int k=0;k<n;k++)
	{
		sum+=A[A.size()-k-1]*(pow(2,k));
	}
	cout<<sum;
}