> #include <iostream>
> #include <queue>
> using namespace std;
> priority_queue<int> q;
> int main(){
>     int n;
> 	while (cin >> n){
> 	    int ans=0;
> 	    for (int i(1);i<=n;i++){
> 	        int k;
> 	        cin >> k;
> 	        q.push(-k);
> 	    }
> 	    while (q.size()>1){
> 	        int a=q.top();
> 	        q.pop();
> 	        int b=q.top();
> 	        q.pop();
> 	        ans+=a+b;
> 	        q.push(a+b);
> 	    }
> 	    q.pop();
> 	    cout << -ans << endl;
> 	}
> 	return 0;
> }