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

int compare(const void * a, const void * b)
{
    return ( *(int*)a - *(int*)b );
}
 
int main() {
    int n;
    cin>>n;
    int c[n];
    int i,j=0;
    for(i=0;i<n;i++)
        cin>>c[i];
    qsort(c, n, sizeof(int), compare);
    long long int count=0;
    for(i=n-1;i>=0;i--)
        {
        count+=c[i]*(long long int)(pow(2,j));
        j++;
    }
    cout<<count;
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}