#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
priority_queue<int, vector<int>, greater<int> > q;
int n,ans=0,x,a,b,c;
void input(){
	cin>>n;
	for(int i=1;i<=n;i++) scanf("%d",&x),q.push(x);
}
void work(){
	while(!q.empty()){
		a=q.top();q.pop();
		b=q.top();q.pop();
		ans+=a+b;q.push(a+b);
		c=q.top();q.pop();
		if(q.empty()) break;
		else q.push(c);
	}
	cout<<ans;
}
int main(){
	freopen("fruit.in","r",stdin);
	freopen("fruit.out","w",stdout);
	input();
	work();
	return 0;
}