#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int n;
    cin >> n;
    vector<int> v(n);
    unsigned long long int res = 0;
    for(auto &i : v){
        cin >> i;
    }
    sort(v.begin(),v.end(),[](int a,int b) {return a > b;});
    unsigned long long int prev = 1;
    for(auto &i : v){
        res += (i*prev);
        prev *= 2;
    }
    cout << res << endl;
    return 0;
}