BNU校外请使用http://www.bnuoj.com,新建contest时请规范命名

Squarefree number

Time Limit: 3000ms
Memory Limit: 32768KB
This problem will be judged on HDU. Original ID: 3826
64-bit integer IO format: %I64d      Java class name: Main
In mathematics, a squarefree number is one which is divisible by no perfect squares, except 1. For example, 10 is square-free but 18 is not, as it is divisible by 9 = 3^2. Now you need to determine whether an integer is squarefree or not.

Input

The first line contains an integer T indicating the number of test cases.
For each test case, there is a single line contains an integer N.

Technical Specification

1. 1 <= T <= 20
2. 2 <= N <= 10^18

Output

For each test case, output the case number first. Then output "Yes" if N is squarefree, "No" otherwise.

Sample Input

2
30
75

Sample Output

Case 1: Yes
Case 2: No

Source


Distributed under GPLv3. | Project Homepage | Developer: 51isoft crccw | Current Style: .