#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
void swap(int *m,int *n)
{
    int t;
    t=*m;    
    *m=*n;
    *n=t;
}

int partition(int *arr, int left, int right)
{
    int pivot=arr[left];
    int si=left, li=right;
    
    while(si<=li)
    {
        while(arr[si]<=pivot && si<=li)
            si++;
    
        while(arr[li]>pivot)
            li--;
        
        if(si<=li)
            swap(&arr[si],&arr[li]);
    }
    
    arr[left]=arr[li];
    arr[li]=pivot;
    
    return li;
}    

void Quicksort(int *arr, int left, int right)
{
    if(left<right)
    {
        int k=partition(arr,left,right);
        
        Quicksort(arr, left, k-1);
        Quicksort(arr, k+1, right);
    }
    
}        

int main(){
    int n,i; 
    scanf("%d",&n);
    int *c = malloc(sizeof(int) * n);
    for(int calories_i = 0; calories_i < n; calories_i++){
       scanf("%d",&c[calories_i]);
    }
    long m=0;
    Quicksort(c,0,n-1);
    
    for(i=n-1; i>=0; i--)
    {
           m+=pow(2,(n-1-i))*c[i];        
    }
    
    printf("%ld",m);
    return 0;
}