#include<bits/stdc++.h>
using namespace std;
priority_queue<int,vector<int>,greater<int> > q;
int main(){
	int n,x,y;
	long long sum=0;
	cin>>n;
	while(n--){
		cin>>x;
		q.push(x);
	}
	while(q.size()!=1){
		x=q.top();
		q.pop();
		y=q.top();
		q.pop();
		sum+=x+y;
		q.push(x+y);
	}
	cout<<sum;
}