spoj#OEN. One Eight_Nine

One Eight_Nine

 

Description:

Suppose you have a number of three digits, which is P. Add those three digits and store in X. Then subtract X from the actual number P. After Subtraction, now the resulting number is N. In this problem, you are given sum of last two digits of N. Your task is to find the first digit of N.

For example, suppose P = 123, X = 1+2+3 = 6, N = P - X =123 - 6 = 117 . Sum of last two digits is 8 . So, in this case, first digit is 1

Input

Input starts with an integer T (1<=1000000), denoting the number of test cases. Each case contains sum of last two digits of N (0 ≤ N ≤ 18).

Output

For each test case, output one line containing "Case x: M“, where x is the test case number,  M is the first digit of N.

Example

Input:

2

8

13

Output:

Case 1: 1

Case 2: 5