#include<stdio.h>
#include<iostream>
#include<queue>
#include<algorithm>
#define inf 0x3f3f3f3f
using namespace std;
 
priority_queue<int>pq;
 
int main()
{
    long n,i,a,num1,num2,num3;
    long long sum;
 
    while(scanf("%ld",&n)&&n)
    {
        for(i=0;i<n;i++)
        {
            scanf("%ld",&a);
            pq.push(a*(-1));
        }
 
        sum=0;
 
 
        for(i=0;i<n-1;i++)
        {
            num1=pq.top();
            pq.pop();
 
            num2=pq.top();
            pq.pop();
 
            num3=(num1*(-1))+(num2*(-1));
 
            sum+=num3;
            pq.push(num3*(-1));
 
        }
        pq.pop();
 
        cout<<sum<<endl;
 
    }
 
    return 0;
}