#include <iostream>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;

long long N, A[1 << 20];

int main() {
	cin >> N;
	for (int i = 0; i < N; i++) cin >> A[i];
	sort(A, A + N);
	reverse(A, A + N);

	long long Answer = 0;
	long long r = 0, s = 1;
	for (int i = 0; i < N; i++) {
		Answer += r * A[i];
		s--;
		if (s == 0) {
			r += 1; s = (1 << r);
		}
	}
	cout << Answer << endl;
	return 0;
}