#include<bits/stdc++.h> 
using namespace std;
vector<int>a;
int main()
{
    int n,i,j,x,y,ans=0;
    
    make_heap(a.begin(),a.end(),greater<int>());
    cin>>n;
    for(i=0;i<n;i++)
	{
        cin>>x;
        a.push_back(x);
    }
   
    while(a.size()>1)
	{
        x=a.front();
        pop_heap(a.begin(),a.end(),greater<int>());
		a.pop_back();
		
        y=a.front();
        pop_heap(a.begin(),a.end(),greater<int>());
		a.pop_back();
		
        
        a.push_back(x+y);
        push_heap(a.begin(),a.end(),greater<int>());
        ans+=(x+y);
	}
    cout<<ans<<endl;
	return 0;
}