#include<iostream>
#include <queue>
#include<algorithm>
#include<cstring>
using namespace std;
int fruit[10000+10];
struct node{

  int  m;
  bool operator<(const node &a) const
  {
      return a.m<m;
  }

};
int main()
{
    int n;

    while(cin>>n)
    {
        priority_queue<node>Q;
        node p;
        for(int i=0;i<n;i++)
        {
            cin>>p.m;
            Q.push(p);
        }
        int sum=0;
        node fir,sec;
        node temp;
        for(int i=0;i<n-1;i++)
        {
            fir=Q.top();
            Q.pop();
            sec=Q.top();
            Q.pop();
            sum+=fir.m+sec.m;
            temp.m=fir.m+sec.m;
            Q.push(temp);
        }
        while(!Q.empty())
        {
            Q.pop();
        }
        cout<<sum<<endl;
    }
    return 0;
}