Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory. It states:
> Every even integer greater than 2 can be expressed as the sum of two primes.
The conjecture has been shown to hold up through **4 X 10<sup>18</sup>**, but remains unproven despite considerable effort. Let's modify this one a little bit. Let's say,
> Any number greater than 2 can be written as sum of 1 or more primes.
Now you are given the task to check this conjecture. You have to find out if a number **N** can be written as sum of 1 or more primes. A bit too easy, eh? Ok, let's make it more difficult(!). You need to find out, in how many ways the number **N** can be written as sum of 1 or more primes.
Input:
------
Input starts with an integer **T (1 ≤ T ≤ 100)**, denoting the number of test cases.
Each case contains an integer **N (2 ≤ N ≤ 1000)**.
Output:
-------
For each case of input, you need to print the case number, followed by the number of ways. If **N** can't be written in such way, print **"Wrong"** (without the quotation marks).
Sample Input
------------
2
5
10
Sample Output
-------------
Case 1: 2
Case 2: 5