#include<bits/stdc++.h>
using namespace std;
priority_queue<int,vector<int>,greater<int> >Q;//优先队列,最小值优先，注意空格 
int total=0;

int main()
{
	int n,x;
	cin>>n;
	while(n--)
	{
		cin>>x;
		Q.push(x);
	 } 
	while(Q.size()!=1)
	{
		int sum=0;
		sum+=Q.top();
		Q.pop();
		sum+=Q.top();
		Q.pop();
		Q.push(sum);
		total+=sum;
	}
	cout<<total;
	return 0;
}