#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<iomanip>
#include<cstdlib>
#include<queue>
#define Maxn
#define ll long long
using namespace std;
ll n,ans,a,m,g;
int main()
{
    priority_queue <int> q;
    scanf("%lld",&n);
    for(ll i=0;i<n;i++) {scanf("%lld",&a);q.push(0-a);}
    while(q.size()>1)
    {
        m=q.top();
        q.pop();
        g=q.top();
        q.pop();
        ans=ans-m-g;
        q.push(m+g);
    }
    printf("%lld",ans);
}