#include <iostream>
#include <queue>
using namespace std;
int n;
priority_queue<int, vector<int>, greater<int> > q;
long long res;
int main()
{
cin >> n;
while(n--)
{
int a;
cin >> a;
q.push(a);
}
while(q.size() > 1)
{
int x = q.top();
q.pop();
int y = q.top();
q.pop();
q.push(x + y);
res = res + (x + y);
}
cout << res;
return 0;
}