void solve() {
        int N = ni();
        while (N > 0) {
            PriorityQueue<Integer> q = new PriorityQueue();
            for (int i = 0; i < N; i++) {
                q.add(ni());
            }
            long result = 0;
            while (q.size() > 1) {
                int a = q.poll();
                int b = q.poll();
                result+= a+b;
                q.add(a+b);
            }
            out.println(result);
            N = ni();
        }
    }