#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

bool comp(int a,int b){
    return a>b;
}

int main() {
    int n,x,a,b;
    while(cin>>n){
        int res = 0;
        vector<int> vec;
        while(n--){
            cin>>x;
            vec.push_back(x);
        } // 收集完毕
        while(vec.size()>1){
            sort(vec.begin(),vec.end(),comp); // 从大到小排序完毕
            a = vec.back();vec.pop_back();
            b = vec.back();vec.pop_back();
            res += a+b;
            vec.push_back(a+b);
        } // 计算完毕
        cout<<res<<endl;
    }
}