#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main(){
    ll n, res = 0, k = 0;
    cin>>n;
    vector<ll> v(n);
    while(n--) {
        cin>>v[k++];
    }
    sort(v.begin(), v.end());
    k = 0;
    for(ll i=v.size()-1;i>=0;i--) {
        res += pow(2, k) * v[i];
        k++;
    }
    cout<<res;
    return 0;
}