#include <iostream>
#include <queue>
using namespace std;

struct node{
	int t;
	bool operator < (const node & a) const{
		return t>a.t;
	}
};



int find(int *f,int n){
	if(f[n] == n)
		return n;
	f[n] = find(f,f[n]);
	return f[n];
}

bool cac(int *f,int n){
	int l=find(f,f[0]);
	for(int i=1;i<n;i++)
		if(find(f,f[i]) != l){
//			cout<<i<<endl;
			return false;
		}
	return true;
}

void log(int *f, int n){
	cout<<endl<<"f:";
	for(int j=0;j<n;j++)
		cout<<" "<<f[j];
	cout<<endl;
}

int main(){
	int n;
	cin>>n;
	priority_queue<node> q;
	if(n <= 0){
		cout<<0;
		return 0;
	}
	
	for(int i=0;i<n;i++){
		int t;
		cin>>t;
		node l;
		l.t = t;
		q.push(l);
	}
//	log(f, n);
	node l;
	int sum=0;
	while(q.size() != 1){
		int s=0;
		l = q.top();
		q.pop();
		s = l.t;
		l = q.top();
		q.pop();
		l.t += s;
		sum += l.t;
		q.push(l);
	}
	l = q.top();
	cout<<sum;
	return 0;
}