#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
priority_queue<int, vector<int>, greater<int> > q;
int N;
int ()
{
    long long ans = 0;
 ios::sync_with_stdio(false);
    cin >> N;
    for (register int i = 1; i <= N; ++i)
  {
        int a;
      cin >> a;
        q.push(a);
   }
    while (q.size() >= 2)
    {
        int l1, l2;
     l1 = q.top(), q.pop();
       l2 = q.top(), q.pop();
       ans += l1 + l2;
      q.push(l1 + l2);
 }
    cout << ans << endl;
 return 0;
}