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