#include<iostream>
#include<queue>
#define ll long long
using namespace std;
priority_queue<ll,vector<ll>,greater<ll> >q;
ll n,t,ans;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>t;
		q.push(t);
	}
	while(q.size()>1){
		ll x=q.top();q.pop();
		ll y=q.top();q.pop();
		t=x+y;
		ans+=t;
		q.push(t);
	}
	cout<<ans;
	return 0;
}