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