#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;

typedef long long ll;

int main() {
    int n;
    cin >> n;
    vector<int> A(n);
    rep(i, n) cin >> A[i];
    sort(A.begin(), A.end());
    ll ans = 0;
    rep(i, n) {
        int j = i + 1, F = 0;
        while (j > 1) {
            F++;
            j /= 2;
        }
        //cout << A[n - 1 - i] << "*" << F << "\n";
        ans += A[n - 1 - i] * F;
    }
    cout << ans << "\n";
}