#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int cmp (const void *a, const void *b) {
	int x = *(int *)a;
	int y = *(int *)b;
	return (x > y) - (x < y);
}

int main () {
	int N;
	while (scanf("%d", &N) == 1) {
		int arr[N];
		for (int i = 0; i < N; i++) {
			scanf("%d", &arr[i]);
		}
		
		int cnt = 0;
		int res = 0;
		while (cnt < N - 1) {
			qsort(arr + cnt, N - cnt, sizeof(int), cmp);
			arr[cnt + 1] = arr[cnt] + arr[cnt + 1];
			res += arr[cnt + 1];
			cnt++;
		}
		printf("%d\n", res);
	}
	return 0;
}