#include<bits/stdc++.h>

#define rep(i,x,y) for(register int i=x;i<=y;i++)

#define ll long long

using namespace std;

const int maxn=;

inline int read(){

    char ch=getchar(); int f=,x=;

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

    while(ch>=''&&ch<='')x=x*+ch-'',ch=getchar();

    return f*x;}

int n;ll ans;

struct node{

    ll v;bool operator<(const node &b)const

    {return v>b.v;}};priority_queue<node>q;

int main(){

    n=read();

    rep(i,,n){int x=read(); q.push((node){x});}

    rep(i,,n-){

        ll x=q.top().v;q.pop();

        ll y=q.top().v;q.pop();

        q.push((node){x+y});ans+=x+y;}

    printf("%lld",ans); return ;

}