#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
priority_queue <int,vector<int>,greater<int> > q;
int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        int x;
        cin>>x;
        q.push(x);
    }
    long long ans=0;
    while(--n){
        int t = 0;
        t += q.top();
        q.pop();
        t += q.top();
        q.pop();
        ans += t;
        q.push(t);
    }
    cout<<ans;
    return 0;
}