#include <bits/stdc++.h>
#include <queue>
using namespace std;
priority_queue<long long,vector<long long>,greater<long long> > q;
long long n,x,ans;
int main()
{
	cin>>n;
	for(long long i=1;i<=n;i++)
	{
		cin>>x;
		q.push(x);
	}
	while(q.size()>=2)
	{
		long long a=q.top();
		q.pop();
		long long b=q.top();
		q.pop();
		ans+=a+b;
		q.push(a+b);
	}
	cout<<ans;
	return 0;
}