#include <fstream>
#include <algorithm>
#include <queue>
#define N 15010
using namespace std;
typedef long long ll;
priority_queue<ll,vector<ll>,greater<ll> > Q;
int n;
ifstream in("poker.in");
ofstream out("poker.out");
void read()
{
	int i,x;
	in>>n;
	for(i=1;i<=n;i++)in>>x,Q.push(x);
}
void work()
{
	int i;
	ll x,y;
	ll ans=0;
	while(Q.size()>1)
	{
		x=Q.top();Q.pop();
		y=Q.top();Q.pop();
		ans+=(x+y);
		Q.push(x+y);
	}
	out<<ans<<endl;
}
int main()
{
	read();
	work();
	return 0;
}