#include <iostream>
#include <cmath>

using namespace std;

int n, c[41];
long long kq;
int main()
{
    int i, j, t;
    cin >> n;
    for (i = 1; i <= n; i++) cin >> c[i];
    for (i = 1;  i < n; ++i)
        for (j = i + 1; j <= n; ++j)
        if (c[i] < c[j]) swap(c[i], c[j]);
    kq = 0;
    for (i = 1; i <= n; ++i) kq = kq + pow(2, i - 1)*c[i];
    cout << kq;
    return 0;
}