#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#define maxn 100010
using namespace std;

typedef long long ll;

int n;
int a[maxn];

priority_queue<ll, vector<ll>, greater<ll> > Q;

int main(){
	freopen("poker.in", "r", stdin);
	freopen("poker.out", "w", stdout);
	scanf("%d", &n);
	for(int i = 1; i <= n; i ++)
	    scanf("%d", &a[i]), Q.push(a[i]);
	ll sum = 0;
	while(Q.size() > 1){
		ll u = Q.top(); Q.pop();
		ll v = Q.top(); Q.pop();
		ll now = u + v;
		sum += now;
		Q.push(now);
	}
	cout << sum << endl;
	return 0;
}