#include <stdio.h>
#include <algorithm>


long long n,x, answer=0;
long long cupcake[50];


int main()
    {
    scanf("%lld",&n);
    for(long long i=0;i<n;i++)
        scanf("%lld",&cupcake[i]);
    std::sort(cupcake,cupcake+n);
    std::reverse(cupcake,cupcake+n);
    for(long long i=0,k=1;i<n;i++,k*=2)
        {
        x = cupcake[i]*k;
        answer+=x;
        }
    printf("%lld",answer);
    return 0;
    }