#include<bits/stdc++.h>
using namespace std;
int n,a,i,k,s;
int main(){
    priority_queue<int, vector<int>, greater<int> >q; 
    cin>>n;
    for(i=1;i<=n;i++){
        cin>>a;
        q.push(a);
    }
    while(q.size()!=1){
        k=q.top();
        q.pop();
        k+=q.top();
        q.pop();
        s+=k;
        q.push(k);
    }
    cout<<s;
    return 0;
}