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

prefix = [0] * (n + 1)
for i in range(n):
    prefix[i + 1] = prefix[i] + A[i]

current = 0
total_cost = 0
k = 0

while current < n:
    m = 1 << k  # Equivalent to 2^k
    take = min(m, n - current)
    sum_segment = prefix[current + take] - prefix[current]
    total_cost += sum_segment * k
    current += take
    k += 1

print(total_cost)