#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define rrep(i, n) for (int i = (int)n-1; i >= 0; --i)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

__attribute__ ((constructor))
void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
}

int main(){
    int n;
    cin >> n;

    vector<ll> a(n);

    for (auto& u : a) cin >> u;

    sort(a.rbegin(), a.rend());

    vector<ll> a_new(n);
    FOR(i, 1, int(a.size())) a_new.push_back(a[i]);
    sort(a_new.rbegin(), a_new.rend());

    int now_kai = 1;
    int now_index = 0;
    ll ans = 0;

    while(now_index < int(a_new.size())){
        int max_ = 1 << now_kai;
        while(max_ && now_index < int(a_new.size())){
            ans += a_new[now_index] * now_kai;
            now_index++;
            max_--;
        }
        now_kai++;
    }

    cout << ans << endl;

    return 0;
}