#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
const int maxn=50;
int n;
long long a[maxn],ans;

int main()
{
    scanf("%d",&n);
    for (int i=1;i<=n;++i) scanf("%lld",&a[i]);
    sort(a+1,a+n+1);
    for (int i=n;i>=1;--i)
    {
        ans+=(1ll<<(n-i))*a[i];
    }
    printf("%lld",ans);
    return 0;
}