#include<bits/stdc++.h>
using namespace std;
priority_queue<long long, vector<long long>, greater<long long>> q;
long long n, cnt, a;
inline void compute() {
	while (q.size() != 1) {
		a = q.top();
		q.pop();
		a += q.top();
		q.pop();
		q.push(a);
		cnt += a;
	}
	printf("%lld",cnt);
}
inline void read() {
	scanf("%lld",&n);
	for (int i = 1; i <= n; ++i) {
		int a;
		scanf("%lld",&a);
		q.push(a);
	}
	compute();
}


signed main() {
	read();
	return 0;
}haxw