#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    int n; cin>>n;
    ll a[100010];
    for(int i=0; i<n; i++){
        cin>>a[i];
    }
    sort(a, a+n, greater<ll>());
    ll ans=0;
    int f=0;
    for(int i=0; i<n; i++){
        ans+=f*a[i];
        if(i+2==(1<<(f+1))) f++;
    }
    cout<<ans<<endl;
    return 0;
}