import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner s1 = new Scanner(System.in);
        int n=s1.nextInt();
        long a[]=new long[n];
        for(int i=0;i<n;i++){
            a[i]=s1.nextLong();
        }
        long count=0;
        Arrays.sort(a);
        for(int i=n-1;i>=0;i--){
            count=(long)(count+a[i]*(Math.pow(2,n-1-i)));
        }
        System.out.println(count);
        
    }
}