#include <bits/stdc++.h>
using namespace std;

typedef long long LL;

const int N = 1e6 + 5;
int n;
LL a[N]; 
priority_queue<LL, vector<LL>, greater<LL> > q;

int main()
{
	scanf("%d", &n);
	for (int i = 1; i <= n; i ++ ) 
	{
		scanf("%lld", &a[i]);
		q.push(a[i]);
	}
	
	LL ans = 0;
	while (q.size() > 1)
	{
		LL x = q.top(); q.pop();
		LL y = q.top(); q.pop();
		ans += (LL)max(x, y);
		q.push(x + y);
	}
	printf("%lld", ans);

	return 0;
}