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

k = 0
start = 0
end = 1
ans = 0
C = 0
while True:
    if end >= N:
        ans += sum(A[start:])*C
        break
    else:
        ans += sum(A[start:end])*C
    #print(ans)
    C += 1
    start = end
    end = (end+1)*2 - 1
print(ans)