#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<queue>
using namespace std;
priority_queue<int,vector<int>,greater<int> > q;int n;int temp;int ans=0;
inline void readln(){
	freopen("fruit.in","r",stdin);
	freopen("fruit.out","w",stdout);
	scanf("%d",&n);
	for (int i=1;i<=n;i++){
		scanf("%d",&temp);
		q.push(temp);
	}
}
inline void work(){
	while (q.size()-1){
		int a=q.top();q.pop();
		int b=q.top();q.pop();
		int c=a+b;ans+=c;
		//printf("a=%d b=%d c=%d\n",a,b,c);
		q.push(c);
	}
}
int main(){
	readln();
	work();
	printf("%d",ans);
	fclose(stdin);fclose(stdout);
	return 0;
}