#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>



#include<stdlib.h>
#include<stdio.h>


void merge(long long int arr[], int l, int m, int r)
{
   long long int i, j, k;
   long long int n1 = m - l + 1;
   long long int n2 =  r - m;

    
  long long  int L[n1], R[n2];

    
    for (i = 0; i < n1; i++)
        L[i] = arr[l + i];
    for (j = 0; j < n2; j++)
        R[j] = arr[m + 1+ j];

    
    i = 0; // Initial index of first subarray
    j = 0; // Initial index of second subarray
    k = l; // Initial index of merged subarray
    while (i < n1 && j < n2)
    {
        if (L[i] <= R[j])
        {
            arr[k] = L[i];
            i++;
        }
        else
        {
            arr[k] = R[j];
            j++;
        }
        k++;
    }

    
    while (i < n1)
    {
        arr[k] = L[i];
        i++;
        k++;
    }

   
    while (j < n2)
    {
        arr[k] = R[j];
        j++;
        k++;
    }
}


void mergeSort(long long int arr[], int l, int r)
{
    if (l < r)
    {
        
        int m = l+(r-l)/2;

       
        mergeSort(arr, l, m);
        mergeSort(arr, m+1, r);

        merge(arr, l, m, r);
    }
}

int main(){

   int n;
   scanf("%d",&n);
   long long int ar[n];
   int i;
   for(i=0;i<n;i++){
    scanf("%lld",&ar[i]);
   }

   mergeSort(ar,0,n-1);
  long long int sum=0;
   int j=0;
   for(i=n-1;i>=0;i--){
    sum=sum+(ar[i]* pow(2,j));

    j++;
   }
   printf("%lld",sum);

    return 0;
}