#include <iostream>
#include <queue>

using namespace std;

int main()
{
	int n;
	priority_queue<int,vector<int>,greater<int>> minHeap;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		int num;
		cin>>num;
		minHeap.push(num);
	}
	int ans=0;
	int a,b;
	while(minHeap.size()>1)
	{
		a=minHeap.top();
		minHeap.pop();
		b=minHeap.top();
		minHeap.pop();
		ans+=a+b;
		minHeap.push(a+b);
	}
	cout<<ans;
}