def marcsCakewalk(calorie):
    min_calorie = sorted(calorie, reverse=True)
    calories = 0
    for i in range(len(min_calorie)):
        calories += math.pow(2, i) * min_calorie[i]
    return int(calories)

long marcsCakewalk(vector<int> calorie) {
    sort(calorie.begin(), calorie.end(), [](int l, int r){return l > r;});
    long ans = 0;
    for(int i = 0; i < calorie.size(); i++){
        ans += pow(2, i) * calorie[i];
    }
    return ans;
}

public static long marcsCakewalk(List<Integer> calorie) {
        // Write your code here
        long size = calorie.size();
        long sum = 0;
        Collections.sort(calorie, Collections.reverseOrder());
        for (int i = 0; i < size; i++)
            sum += (Math.pow(2, i) * calorie.get(i));
        return sum;
    }

#!/bin/python3

import os

def marcsCakewalk(calorie):
    # Sort the calorie list in descending order
    calorie.sort(reverse=True)
    
    # Initialize the total distance to 0
    total_distance = 0
    
    # Calculate the minimum distance Marc needs to walk
    for i in range(len(calorie)):
        total_distance += calorie[i] * (2 ** i)
    
    return total_distance

if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    n = int(input().strip())

    calorie = list(map(int, input().rstrip().split()))

    result = marcsCakewalk(calorie)

    fptr.write(str(result) + '\n')

    fptr.close()