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


 unsigned long long sort( unsigned long long a[], unsigned long long n)
    {
    
    for( unsigned long long i=1;i<n;i++)
        for( unsigned long long j=i+1;j<=n;j++)
        if(a[j]>a[i])
        {
         unsigned long long temp=a[j]; a[j]=a[i]; a[i]=temp;
    }
 
    return 0;
}


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    
  unsigned long long n;
    cin>>n;
    
   unsigned long long a[n+1];
    
    for( unsigned long long i=1;i<=n;i++)
        cin>>a[i];
    
    
    sort(a,n);
     unsigned long long sum=0;
    
    for( unsigned long long i=1;i<=n;i++)
    sum+=a[i]*pow(2,i-1);
    
    cout<<sum;
   
    
    
    return 0;
}