#include<bits/stdc++.h> using namespace std; int n; int a; priority_queue<int,vector<int>,greater<int> > q; int t; int main() { cin>>n; for(int i=1;i<=n;i++) { cin>>a; q.push(a); } a=0; while(q.size()!=1) { t=q.top(); q.pop(); t+=q.top(); q.pop(); q.push(t); a+=t; } cout<<a; return 0; }