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


int main() {
    int n;
    cin >> n;
    
    vector<int> c(n);
    for(int i=0;i<n; i++){
        cin >> c[i];
    }
    sort (c.rbegin(), c.rend());
    
    long long int sum=0;
    for(int i=0;i<n; i++){
        sum= sum + c[i]*(pow(2,i));
       
    }
    
    cout << sum;
    return 0;
}