#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <bitset>
#include <algorithm>
#include <climits>
using namespace std;
#define LL long long
#define N 510
#define mod 1000000007
#define INF 0x3f3f3f3f
#define lson root<<1
#define rson root<<1|1
priority_queue <int,vector<int>,greater<int> > q;
int main()
{
    freopen("fruit.in","r",stdin);
    freopen("fruit.out","w",stdout);
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int nu;
        while(q.size()) q.pop();
        for(int i=0;i<n;i++)
        {
            scanf("%d",&nu);
            q.push(nu);
        }
        int sum = 0;
        while(q.size()>1)
        {
            int a = q.top();
            q.pop();
            int b = q.top();
            q.pop();
            q.push(a+b);
            sum += a+b;
        }
        printf("%d\n",sum);
    }
    return 0;
}