//WPL = 结点权值 * 路径长度 → 反复加上"路径长度"次的"结点权值"

#include <iostream>
#include <queue>

using namespace std;

int main(){

    int n;
    cin >> n;
    priority_queue<int,vector<int>,greater<int>> heap;   //建立小根堆

    while(n--){
        int x;
        cin >> x;
        heap.push(x);
    }

    int res = 0;
    while(heap.size()>1){
        int a = heap.top();
        heap.pop();
        int b = heap.top();
        heap.pop();
        res += a+b;    //将a+b存进后，之后会以(a+b)的形式再统计进res中，实现结点权值的累加
        heap.push(a+b);
    }

    cout << res << endl;

    return 0;
}