#include <bits/stdc++.h>

using namespace std;
typedef unsigned long long ull;

int main(){
    int n;
    cin >> n;
    
    vector<ull> v(n);
    for(int i = 0; i < n; i++){
        cin >> v[i];
    }
    sort(v.begin(), v.end());

    ull sum = 0;
    ull mul = 1;
    for (int i = n-1; i >= 0; i--){
        sum += mul * v[i];;
        mul *= 2;
        //cout << sum << endl;
    }
    cout << sum << endl;
    return 0;
}