#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
long long n,a[10001];
long long ans;
main()
{
    scanf("%lld",&n);
    for (int i=1;i<=n;i++)
    scanf("%lld",&a[i]);
    sort(a+1,a+n+1);
    ans=0;
    for (int i=2;i<=n;i++)
    {
        a[i]=a[i-1]+a[i];
        ans+=a[i];
        int k=i;
        while  (a[k]>a[k+1]&&k<n)
        {
            swap(a[k],a[k+1]);
            k++;
        }
    }
    printf("%lld",ans);
}