#10：TLE

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e4 + 5;
int a[maxn];
int main() {
	int n, ans = 0;
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i < n; i++) {
		sort (a + i, a + 1 + n);
		ans += a[i] + a[i + 1], a[i + 1] = a[i] + a[i + 1];
	}
	cout << ans;
	return 0;
}