#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <cstring>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < int(n);i++)
const ll INF = 1e9;

int main(){
	int n;
	cin >> n;
	vector<ll> v(n);
	rep(i,n) cin >> v[i];
	sort(v.begin(),v.end());
	ll ans = 0;
	ll now = 1;
	ll cnt = 0;
	int f = 0;
	for (int i = n-1;i >= 0;i--){
		if (now <= cnt){
			cnt = 0;
			now <<= 1LL;
			f++;
		}
		ans += v[i]*f;
		cnt++;
	}
	cout << ans << endl;

}