#include<bits/stdc++.h>
using namespace std;
int n,a[10005],x,y,ans;
priority_queue<int>q;
int main()
{
    freopen("fruit.in","r",stdin);
    freopen("fruit.out","w",stdout); 
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
        scanf("%d",&a[i]);
        q.push(-a[i]);
    }
    while(q.size()>1)
    {
        x=q.top(),q.pop();
        y=q.top(),q.pop();
        q.push(x+y);
        ans+=x+y;
    }
    printf("%d",-ans);
	return 0;
}