#include<bits/stdc++.h>
using namespace std;

struct Node{
	int x;
	Node(int a){x = a;}
};

bool operator<(const Node &a, const Node &b){
	return a.x > b.x;
}

int main(){
	int n; 
	
	while(cin >> n){
	
		priority_queue<Node> pq;
		while(n --){
			int t; cin >> t;
			pq.push(t);
		}

		int res = 0;
		while(pq.size() > 1){
			int x = pq.top().x;
			pq.pop();
			int y = pq.top().x;
			pq.pop();
			res += (x + y);
			pq.push(Node{(x + y)});
		}

		cout << res << endl;
	}
		
	return 0;
}