#include<iostream>
#include<queue>

using namespace std;

int n,res;
int main()
{
	while(cin>>n)
	{
		priority_queue<int,vector<int>,greater<int>> q;
		res=0;
		for(int i=1;i<=n;i++)
		{
			int x;
			cin>>x;
			q.push(x);
		}
		while(q.size()!=1)
		{
			int a=q.top();
			q.pop();
			int b=q.top();
			q.pop();
			int sum=a+b;
			res+=sum;
			q.push(sum);
		}
		cout<<res<<endl;
	}
	return 0;
}