#include <bits/stdc++.h>

using namespace std;

int a[10086],n;

long long num,nw;

priority_queue <long long> q;

int read () {
	char o;
	int cc=0;
	int l=1;
	o=getchar();
	
	while (o>'9'||o<'0'){
		if(o='-')l=-1;
		o=getchar();
	}
	while (o<='9'&&o>='0'){
		cc=cc*10+o-'0';
		o=getchar();
	}
	return cc;
}

int main () {
    
    freopen("fruit.in","r",stdin);
    freopen("fruit.out","w",stdout);
	
	cin>>n;
	
	for(int i = 0; i<n; i++){
		int qq;
		qq=read();
		q.push(-qq);
	}
	
	while (q.size()>1){
		long long a1=-q.top();
		q.pop();
		long long a2=-q.top();
		q.pop();
		long long tot =a1+a2;
		q.push(-tot);
		num+=(a1+a2);
	}
	cout<<num;
	return 0;
}