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


int main() {
   int n;
    cin>>n;
    vector<int > cup(n,0);
    for(int i=0; i<n; i++)
        cin>>cup[i];
    sort(cup.begin(),cup.end());
    long sum;
    for(int i=n; i>0;i--)
        sum+=cup[i-1]*pow(2,(n-i));
    cout<<sum<<endl;
    return 0;
}