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

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