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