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

int main() {
	long long n; cin >> n;
	long long A[50000];
	for (int i = 0; i < n; i++) cin >> A[i];
	long long ans = 0;

	sort(A, A + n, greater<long long>());
	for (long long i = 0; i < n; i++) {
		long long B = i + 1;
		long long count = 0;
		while (B != 1) {
			B /= 2;
			count++;
		}
		ans += count * A[i];
	}
	cout << ans << endl;
}