import java.util.*;

public class Solution {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] c = new int[n];
        for (int i = 0; i < n; i++) {
            c[i] = scanner.nextInt();
        }
        Arrays.sort(c);
        long ans = 0;
        for (int i = 0; i < n; i++) {
            ans += (1L << i) * c[n - i - 1];
        }
        System.out.println(ans);
    }
}