#include <bits/stdc++.h>

    using namespace std;

#define N 41

int n;
typedef unsigned long long ll;
int a[N];

int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", a + i);
    sort(a + 1, a + n + 1);
    ll p2[N];
    p2[1] = 2;
    for (int i = 2; i <= 40; i++) p2[i] = p2[i - 1]*2;
    ll answ = a[n];
    for (int i = n - 1; i > 0; i--){
        answ += p2[n - i]*a[i];
    }
    cout<<answ;
}