Parencedence!

Time Limit: 1000 ms Memory Limit: 65536 KiB

Problem Description

Input

The first line of the input file will contain an integer n indicating the number of test cases. The test cases will follow, one per line, each consisting of a positive integer m ≤ 9 followed by an arithmetic expression. The value of m indicates the number of binary operators in the arithmetic expression. The only operators used will be ‘+’, ‘-’ and ‘*’. The ‘-’ operator can appear as both a unary and a binary operator. All binary operators will be surrounded by a single space on each side. There will be no space after any unary ‘-’. No combination of parentheses will ever result in an integer overflow or underflow.

Output


Sample Input

2
4 3 - 6 * 4 - 7 + 12
2 45 - -67 - 3

Sample Output

Case 1:
Player 1 (7+12) leads to -2
Player 2 (3-6) leads to -27
Player 2 wins
Case 2:
Player 1 (-67-3) leads to 115
Player 2 (45--67) leads to 109
Player 1 wins

Hint

 

Source

2012 East Central Regional Contest