#include<iostream>

#include<queue>

#include<cstdio>

using namespace std;

typedef long long ll;

priority_queue<ll,vector<ll>,greater<ll> >q;

int n;

inline ll read()

{

    ll f=,x=;char c=getchar();

    while(c<''||c>''){if(c=='-')f*=-;c=getchar();}

    while(c>=''&&c<=''){x*=;x+=c-'';c=getchar();}

    return x*f;

}

int main()

{

    freopen("huffman.in","r",stdin);

    freopen("huffman.out","w",stdout);

    n=read();

    for(int i=;i<=n;i++){int l=read();q.push(l);}

    ll ans=;

    while(q.size()>)

    {

        ll a=q.top();q.pop();

        ll b=q.top();q.pop();

        ll x=a+b;

        ans+=x;q.push(x);

    }

    cout<<ans<<endl;

    fclose(stdin);

    fclose(stdout);

    return ;

}