#include<iostream>
#include<string.h>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#define ll long long int
#define ld long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i,n) for(i=0;i<n;i++)
using namespace std;
typedef pair<int, int> P;

string str;

int main()
{

  int n;
  int time[10005];
  int i;

  while(1){
    cin>>n;
    if(n==0)break;
    int sum=0;
    rep(i,n)
      cin>>time[i];
    sort(time,time+n);

    for(i=1;i<n;i++)
      time[i]+=time[i-1];
    rep(i,n-1)
      sum+=time[i];

    cout<<sum<<endl;
  }
}