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

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