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