#include <algorithm>
#include <bits/stdc++.h>
        
using namespace std;
using ll=long long;
 
bool chmin(int& a, int b){ if(a > b){ a = b; return 1; } return 0; }
bool chmax(int& a, int b){ if(a < b){ a = b; return 1; } return 0; }
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
const ll MOD = 1000000007LL;

int main() {
    ll n; 
    cin >> n;
    vector<ll> as(n);
    for (auto& a : as) cin >> a;
    sort(as.begin(), as.end(), greater<>());
    ll cnt = 0, t = 1, floor=0, ans = 0;
    for (ll a : as) {
        if (cnt == t) { 
            cnt = 0;
            floor++;
            t *= 2;
        } 
        ans += a * floor;
        cnt++;
    }
    cout << ans << endl; 
    return 0;
}