#include<iostream>
#include<queue>
using namespace std;

priority_queue<int,vector<int>,greater<int>> q;
int n;
int res;

int main()
{
	cin>>n;
	while(n--)
	{
		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;
	return 0;
}