#include<bits/stdc++.h>

using namespace std;

priority_queue<int,vector,greater > q;

int main()

{ int n;

cin>>n;
for(int i=1;i<=n;i++){
	int x;
	cin>>x;
	q.push(x);
}
int sum=0;
while(q.size()>1){
	int x=q.top();q.pop();
	int y=q.top();q.pop();
	q.push(x+y);
	sum+=x+y;
}
cout<<sum<<endl;
return 0;

}