#include<iostream>

#include<cstdio>

#include<cstring>

#include<queue>

using namespace std;

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

int n,x,ans=,tmp=;

int main()

{

    while(cin>>n){

        ans=;

        while(!q.empty()){

            q.pop();

        }//清空

    for(int i=;i<=n;i++)

        {

            cin>>x;

            q.push(x);

        }

    for(int i=;i<=n-;i++)

        {

            tmp=q.top();

            q.pop();

            tmp=tmp+q.top();

            q.pop();

            q.push(tmp);

            ans=ans+tmp;

        }

        cout<<ans<<endl;

    }

return ;

}