#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

int main()
{
	int n,move=0;
	cin>>n;
	int fruit[n+2];
	for(int i=1;i<=n;i++)
	{
		cin>>fruit[i];
	}
	sort(fruit+1,fruit+n+1);
	for(int j=1;j<=n-1;j++)
	{
		move+=(fruit[j]+fruit[j+1]);
		fruit[j+1]+=fruit[j];
		fruit[j]=0;
		sort(fruit+j,fruit+n+1);
	}
	cout<<move;
	return 0;

#6,7,8,9,10没过 #5 581.2ms