#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    int n,A[n],i;
    long int result=0;
    cin >> n;
    for(i=0;i<n;i++) {
        cin >> A[i];
    }
        vector<int> myvector (A, A+n);               // 32 71 12 45 26 80 53 33
    //sort(A,A+n);
    sort(myvector.begin(), myvector.begin()+n);
    /*for(i=0;i<n;i++) {
        cout << A[i] << endl;
    }*/
    i=n-1;
    for (vector<int>::iterator it=myvector.begin(); it!=myvector.end(); ++it)
        {
        result= result + pow(2,i)*(*it);
        i--;
        //cout << ' ' << *it;
    }
    cout << result;
    return 0;
}