#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll modexpo(ll a,ll b)
{
	ll res=1;
	while(b>0){
        if(b&1) res=(res*a);
        a=(a*a);
        b>>=1;
	}
    return res;
}
int main(){
    int n;
    cin >> n;
    vector<long long int> calories(n);
    ll ans=0;
    for(int calories_i = 0; calories_i < n; calories_i++){
       cin >> calories[calories_i];
    }
    sort(calories.begin(),calories.end());
    reverse(calories.begin(),calories.end());
    for(int calories_i = 0; calories_i < n; calories_i++){
        ans+=(calories[calories_i]*modexpo(2LL,calories_i));
        //cout<<ans<<endl;
    }
    cout<<ans<<endl;
    // your code goes here
    return 0;
}