#include<queue>
#include<stdio.h>
using namespace std;
priority_queue<int, vector<int>, greater<int> > Q;//小顶堆
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
if(n==0)
break;
int i,x;
while(!Q.empty())
Q.pop();
for(i=0;i<n;i++)
{
scanf("%d",&x);
Q.push(x);
}
int sum=0,k=Q.top();
Q.pop();
for(i=1;i<n;i++)
{
k+=Q.top();
sum+=k;
Q.pop();
}
printf("%d\n",sum);
}
return 0;
}
#include<stdio.h>
using namespace std;
priority_queue<int, vector<int>, greater<int> > Q;//小顶堆
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
if(n==0)
break;
int i,x;
while(!Q.empty())
Q.pop();
for(i=0;i<n;i++)
{
scanf("%d",&x);
Q.push(x);
}
int sum=0,k=Q.top();
Q.pop();
for(i=1;i<n;i++)
{
k+=Q.top();
sum+=k;
Q.pop();
}
printf("%d\n",sum);
}
return 0;
}