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


int main() {
    int n;
    cin >> n;
    vector <int> a(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];    
    }
    sort(a.rbegin(), a.rend());
    long long ans = 0;
    for (int i = 0; i < n; i++)
    {
        ans += (1ll << i) * (long long) a[i];    
    }
    cout << ans << '\n';
    return 0;
}