#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

long long Putere(long long a,long long b)
{
    long long sol;
    sol=1;
    while(b > 0)
    {
        if(b%2==1)
            sol=1LL*sol*a;
        a = 1LL* a * a;
        b /= 2;
    }
    return sol;
}

long long n,a[1003];

int main() {
    long long i,s=0,x,j;
    cin>>n;
    for(i=1;i<=n;++i)
        cin>>a[i];
    sort(a+1,a+n+1);
    j=0;
    for(i=n;i>=1;--i)
    {
        x=a[i];
        s+=(x*(Putere(2,j)));
        j++;
    }
    cout<<s<<"\n";
    return 0;
}