#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
priority_queue<int>q;
int n,a,b,z,s;

int main()
{
	freopen("fruit.in","r",stdin);
	freopen("fruit.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		int x;
		scanf("%d",&x);
		q.push(-x);
	}
	if(n==1)cout<<q.top();
	while(q.size()>1)
	{
		a=q.top();
		s-=q.top();
		q.pop();
		b=q.top();
		s-=q.top();
		q.pop();
		z=a+b;
		q.push(z);
	}
	printf("%d",s);
	fclose(stdin);
	fclose(stdout);
	return 0;	
}