#include<bits/stdc++.h>
using namespace std;
int heap[125],size,d,n,ans;
void put(int d)
{
	heap[size++]=d;
	push_heap(heap,heap+size,greater<int>());
}
int get()
{
	pop_heap(heap,heap+size,greater<int>());
	return heap[size--];
}
priority_queue<int, vector<int>,greater<int> >q;
int main()
{
	freopen("fruit.in","r",stdin);
	freopen("fruit.out","w",stdout);
	cin>>n;
	for(int i=0;i<n;i++) 
	{
		cin>>d;
		q.push(d);
	}
	for(int i=1;i<n;i++)
	{
		int a=q.top();
        q.pop();
		int b=q.top();
        q.pop();
		q.push(a+b);
		ans=ans+a+b;
	}
	cout<<ans;
	return 0;
}