#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

const int N = 40;

int a[N];

int main() {
    int n; cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(a, a+n);
    
    unsigned long long res = 0;
    unsigned long long m = 1;
    for (int i = n-1; i >= 0; i--) {
        res += m * a[i];
        m <<= 1;
    }
    cout << res << endl;
    return 0;
}