n = int(input())
A = list(map(int, input().split()))

A.sort(reverse=True)
ans = 0
curr = 0
f = 0
for i in range(n):
    ans += A[i] * f
    curr += 1
    if curr == pow(2, f):
        f += 1
        curr = 0
print(ans)