#include <bits/stdc++.h>
#define NIL (-1)
#define ll long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
const double PI = acos(-1.0);

int main() {
	ll N;
	cin >> N;
	vector<ll> A(N);
	for (int i = 0; i < N; i++) cin >> A[i];

	sort(A.begin(), A.end());
	reverse(A.begin(), A.end());
	ll co = 0, lim = 1, p = 0, ans = 0;
	for (int i = 0; i < N; i++) {
		co++;
		ans += p * A[i];
		if (co == lim) {
			co = 0;
			lim *= 2;
			p++;
		}
	}
	cout << ans << endl;
	return 0;
}