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

long long Pow(int k)
    {
    long long ans=1;
    while(k--)
        {
        ans*=2;
    }
    //cout<<ans;
    return ans;
}
bool myway(int a,int b)
    {
    return a>b;
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    int n;
    cin>>n;
    int arr[n];
    for(int i=0;i<n;i++)
      {
        cin>>arr[i];
    }sort(arr,arr+n,myway);
    long long ans=0;
     for(int i=0;i<n;i++)
         {
         ans+=Pow(i)*arr[i];
     }
    cout<<ans;
    return 0;
}