#include<iostream> 
#include<queue>
using namespace std;
int n;
long long ans;
priority_queue<long long,vector<long long>,greater<long long> > q;
int main(){
    freopen("fruit.in","r",stdin);
    freopen("fruit.out","w",stdout);
    
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        int x;scanf("%lld",&x);
        q.push(x);
    }
    while(q.size()>1){
        int a=q.top();q.pop();
        int b=q.top();q.pop();
        ans+=a+b;
        q.push(a+b);
    }
    printf("%lld",ans);
    
    return 0;
}