#include<bits/stdc++.h>
using namespace std;
int n,m,s,a[1000000],f[1000000],top;
priority_queue<int,vector<int>,greater<int>>h;
int main(){
    freopen("fruit.in","r",stdin);
    freopen("fruit.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        h.push(a[i]);
    }
    while(1){
        if(h.size()==1){
            for(int i=1;i<=top;i++){
                s+=f[i];
            }
            cout<<s;
            return 0;
        }
        int x=h.top();
        h.pop();
        int y=h.top();
        h.pop();
        h.push(x+y);
        f[++top]=x+y;
    }
}