#include<bits/stdc++.h> using namespace std; priority_queue<int, vector<int>, greater<int> > q; int n,x,ans; int main(){ scanf("%d",&x); for(int i=1;i<=n;i++){ scanf("%d",&x); q.push(x); } while(q.size()>1){ int x=q.top(),y=q.top(); q.pop(); q.pop(); ans+=x+y; q.push(ans); } cout<<ans; return 0; }