#include<iostream>
#include<queue>
#include<cstdio>
using namespace std;
int n,x,t,a,b;
priority_queue<int,vector<int>,greater<int> >s;
int main(){
	freopen("fruit.in","r",stdin);
	freopen("fruit.out","w",stdout);
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		cin>>x;
		s.push(x);
	}
	if(n==1){
		cout<<x;
		return 0;
	}
	while(s.size()!=1)
	{
		a=s.top();
		s.pop();
		a+=s.top();
		s.pop();
		t+=a;
		s.push(a);
	}
	cout<<t;
	fclose(stdin);
	fclose(stdout);
	return 0;
}