#include<cstdio>
#include<queue>
#include<iostream>
using namespace std;
const int SIZEN=10010;
priority_queue<int,vector<int>,greater<int> > Q;
int N;
void read()
{
	scanf("%d",&N);
	int a;
	for(int i=1;i<=N;i++)
	{
		scanf("%d",&a);
		Q.push(a);
	}
}
void work()
{
	int ans=0;
	while(Q.size()>1)
	{
		int x=Q.top();Q.pop();
		int y=Q.top();Q.pop();
		int tem=x+y;
		ans+=tem;
		Q.push(tem);
	}
	printf("%d\n",ans);
}
int main()
{
	freopen("poker.in","r",stdin);
	freopen("poker.out","w",stdout);
	read();
	work();
	return 0;
}