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