#include <bits/stdc++.h>
using namespace std;
priority_queue<int,vector<int>,greater<int> >q;
int n,ans;
int main(){
    freopen("fruit.in","r",stdin);
    freopen("fruit.out","w",stdout);
    cin>>n;
    int a;
    for(int i=1;i<=n;i++){
        cin>>a;
        q.push(a);
    }
    int c=0;
    while(1){
        ans+=c;
        c=q.top();
        q.pop();
        if(q.empty()){
            break;
        }
        c+=q.top();
        q.pop();
        q.push(c);
    }
    cout<<ans;
    
    return 0;
}