#include <iostream>
#include <cstring>#include <string>
#include <queue>
#include <cstdio>
using namespace std;
//哈夫曼樹的思想
struct cmp
{
bool operator()(const long long a,const long long b)const{
return a>b;
}
};
int main()
{
int n;
scanf("%d",&n);
priority_queue<long long,vector<long long>,cmp >q;
while(n--)
{
long long x;
scanf("%I64d",&x);
q.push(x);
}
long long sum=0;
if(n==1)sum=q.top();
else
{
while(!q.empty())
{
long long x=q.top();
q.pop();
long long y=q.top();
q.pop();
long long z=x+y;
if(!q.empty())q.push(z);
sum+=z;
}
}
printf("%I64d\n",sum);
return 0;
}