#include <iostream>
#include <queue>
using namespace std;
int main () {
 	int n, t, res = 0;
 	priority_queue <int, vector<int>, 			greater<int> > q;
 	cin >> n;
 	for (int i = 1; i <= n; i++) {
 		cin >> t;
 		q.push(t);
 	}
 	for (int i = 1; i < n; i++) {
 		t = q.top();
 		q.pop();
	 	t += q.top();
 		q.pop();
 		res += t;
 		q.push(t);
	 }
	 cout << res << endl;
 return 0;
}