#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <cstdio>
#include <climits>
#include <queue>
#include <map>
#include <list>
#include <vector>
using namespace std;

struct cmp
{
	bool operator()(long long a, long long b)
	{
		return a > b;
	}
};

int main()
{
	priority_queue<long long, vector<long long>, cmp> pq;
	int n; 
	scanf("%d", &n);
	while (n--)
	{
		int t;
		scanf("%d", &t);
		pq.push(t);
	}
	long long sum = 0;

	while (pq.size() != 1)
	{
		long long a = pq.top();
		pq.pop();
		long long b = pq.top();
		pq.pop();
		sum += a + b;
		pq.push(a+b);
	}
	printf("%lld\n", sum);

	return 0;
}