#include<bits/stdc++.h>
using namespace std;
long long n,a[10005],s = 0;
int main(){
	stack<int> q;
	cin >> n;
	for(int i = 1;i <= n;i++){
		cin >> a[i];
	}
	sort(a+1,a+n+1);
	for(int i = n;i >= 1;i--){
		q.push(a[i]);
	}
	int p = 0;
	while(1){
		p++;
		int a = q.top();
		q.pop();
		int b = q.top();
		q.pop();
		s += a;
		s += b;
		q.push(s);
		if(p == n-1) break;
	}
	cout << s;
	return 0;
}