#include <bits/stdc++.h>
using namespace std;
priority_queue<int,vector<int>,greater<int> > a;
int ans;
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
int k;
cin>>k;
a.push(k);
}
for(int i=1;i<n;i++){
int x=a.top();
a.pop();
int y=a.top();
a.pop();
a.push(x+y);
ans+=x+y;
}
cout<<ans;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnByaW9yaXR5X3F1ZXVlPGludCx2ZWN0b3I8aW50PixncmVhdGVyPGludD4gPiBhOwppbnQgYW5zOwppbnQgbWFpbigpewoJaW50IG47CgljaW4+Pm47Cglmb3IoaW50IGk9MTtpPD1uO2krKyl7CgkJaW50IGs7CgkJY2luPj5rOwoJCWEucHVzaChrKTsKCX0KCWZvcihpbnQgaT0xO2k8bjtpKyspewoJCWludCB4PWEudG9wKCk7CgkJYS5wb3AoKTsKCQlpbnQgeT1hLnRvcCgpOwoJCWEucG9wKCk7CgkJYS5wdXNoKHgreSk7CgkJYW5zKz14K3k7Cgl9Cgljb3V0PDxhbnM7Cn0=