#include <cstdio>

 #include <queue>

 using namespace std;

 int main()

 {

     int n;

     while(scanf("%d", &n) ==  && n)

     {

         priority_queue<int, vector<int>, greater<int> > q;

         int x, ans = ;

         for(int i = ; i < n; i++) { scanf("%d", &x); q.push(x); }

         for(int i = ; i < n-; i++)

         {

             int a = q.top(); q.pop();

             int b = q.top(); q.pop();

             ans += a + b;

             q.push(a + b);

         }

         printf("%d\n", ans);

     }

     return ;

 }