#include<iostream>
#include<queue>
using namespace std;
struct T
{
    friend bool operator<(T a, T b)
    {
        return a.x > b.x;
    }
    int x;
};
int main()
{
    priority_queue<T> q;
    T c;
    int n, i;
    cin>>n;
    for(i = 0; i < n; i++)
    {
        cin>>c.x;
        q.push(c);
    }
    n--;
    int sum = 0;
    while(n--)
    {
        int i = q.top().x;
        q.pop();
        int j  = q.top().x;
        q.pop();
        c.x = i + j;
        sum += c.x;
        q.push(c);
    }
    cout<<sum<<endl;
    return 0;
}