n = int(input())
AArr = map(int, input().split())

AArrSort = sorted(AArr, reverse=True)
cost = 0
current = 0
for i in range(n+1):
    for j in range(2 ** i):
        if n == current: 
            break
        else :
            cost += i * AArrSort[current]
            current += 1
    if n == current: 
        break

print(cost)