#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <functional>
using namespace std;
long long a=0;
priority_queue<int,vector<int>,greater<int> >que;
int main(){
    freopen("poker.in", "r", stdin);
    freopen("poker.out", "w", stdout);
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        int temp;
        cin>>temp;
        que.push(temp);
    }
    while (que.size()>1) {
        int k=que.top();
        que.pop();
        k+=que.top();
        que.pop();
        a+=k;
        que.push(k);
    }
    cout<<a;
}