Polish Notation

One way of representing mathematical expressions is with Polish (or prefix) notation, initially developed by Jan Łukasiewicz (1878–1956) for use in logic. In this notation, the operator appears before its operands. For example, rather than writing

using so-called infix notation, we could write the equivalent expression in Polish notation

In this example, the addition applies to the values of the two following expressions, ‘$3$’ and ‘$*\ 4\ 7$’. Further, the multiplication applies to two values that follow it, $4$ and $7$.

In general, we can write an expression in Polish notation using the following rules:

• A constant integer is an expression (e.g. $3$).

• A lowercase single character is an expression (a variable, e.g. $x$).

• If $A$ and $B$ are expressions and $O$ is an operator, then the following is an expression: ‘$O\ A\ B$’. The meaning of this expression in infix notation is ‘$A\ O\ B$’.

The operators that can occur are all binary: addition ($+$), subtraction ($-$), and multiplication ($*$).

Polish notation has the advantage of being easy to parse for a computer. Write a program that reads an expression in Polish notation, simplifies the expression as much as possible, and prints it out in Polish notation. The simplification procedure is just replacing subexpressions that contain no variables with their values wherever possible.

Input

Input consists of several test cases (at most $5$). Each test case is described by a single line containing an expression. The expression is a sequence of space-separated tokens (integers, operators, and single-character lowercase variables). Each expression is correctly formatted in Polish notation, with at most $2\, 048$ symbols (operators and operands combined). Integer constants are in the range $[-10, 10]$.

Output

For each case, display the case number followed by the simplified expression in Polish notation, in the same format as the input. Do not modify the expression other than the simplification step described earlier. All intermediate computations fit within a signed $32$-bit integer. Follow the format of the sample output.

+ 3 4
- x x
* - 6 + x -6 - - 9 6 * 0 c

Case 1: 7
Case 2: - x x
Case 3: * - 6 + x -6 - 3 * 0 c