import java.util.PriorityQueue;
import java.util.Scanner;
public class QueP1715 {
static int X;
static int sum;
static PriorityQueue<Integer> pq;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
X = sc.nextInt();
pq = new PriorityQueue();
for (int i = 0; i < X; i++) {
pq.offer(sc.nextInt());
}
while (pq.size() > 1) {
int tmp =pq.poll()+pq.poll();
sum += tmp;
pq.add(tmp);
}
System.out.println(sum);
}
}