**Ashik** is a little boy. He reads in class 3. He is a very good student and also very good in math. One day he was in his class. The lesson was about divisibility. So teacher taught them how to find out the divisibility of numbers. **Then teacher gave them a number containing exactly one alphabetic character.** There are some possible values of that alphabetic character so that the whole number is divisible by 3. This problem was only solved by the brilliant boy Ashik. Are you as brilliant as Ashik !? Yeah I think so. Now it's your task to find out **the shortest possible value of that alphabetic character for which the total number is divisible by 3.** ***Possible value should be 1 to 9***. ***Note: Solution will always exists and will be between 1 to 9.*** Input: ------ First line contains **T(1<=T<=100)** denoting the number of test cases. The following **T** lines contain a number , say **S**, containing ***exactly one character*** with length **|S| (1<=|S|<=50).** The number must contain a alphabetic character. Output: ------- For each case print the case number first and then **print the value of that particular alphabetic character**. See the sample input output for details. Sample Input ------------ 3 101A 099D567 1153498283B673 Sample Output ------------- Case 1: 1 Case 2: 3 Case 3: 3 **Explanation:**<br> In case 1, If you replace A in 101A with 1 ,then number will be 1011, which is divisible by 3 i.e 1011%3=0.
|Language||Time Limit (seconds)|