#include<bits/stdc++.h>
using namespace std;
priority_queue<int,vector<int>,greater<int> >q;
int main()
{
int k,n,a,b,sum=0;
cin>>n;
for (int i=1;i<=n;i++)
{
cin>>k;
q.push(k);
}
while (q.size()>1)
{a=q.top();
q.pop();
b=q.top();
q.pop();
q.push(a+b);
sum+=a+b;
}

cout<<sum<<endl;
return 0;
}