#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
const int N=10005;
typedef long long ll;
int n;
priority_queue<ll>q;
ll ans;
int main(){
    freopen("fruit.in","r",stdin);
    freopen("fruit.out","w",stdout); 
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        ll x;
        scanf("%lld",&x);
        q.push(-x); 
    }    
    for(int i=1;i<n;i++){
        int x=-q.top();q.pop();
        int y=-q.top();q.pop();
        ans+=x+y;
        q.push(-(x+y)); 
    }
    printf("%lld\n",ans);
    return 0;
}