1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <algorithm>
 5 #include <vector>
 6 #include <cmath>
 7 #include <queue>
 8 #include <stack>
 9 #include <map>
10 #include <string>
11 #include <set>
12 using namespace std;
13 typedef long long LL;
14 const int INF = 2e9;
15 const LL LNF = 9e18;
16 const int MOD = 1e9+7;
17 const int MAXN = 1e6+10;
18
19 bool notprime[MAXN+1];
20 int prime[MAXN+1];
21 void getPrime()
22 {
23     memset(notprime, false, sizeof(notprime));
24     notprime[0] = notprime[1] = true;
25     prime[0] = 0;
26     for (int i = 2; i<=MAXN; i++)
27     {
28         if (!notprime[i])prime[++prime[0]] = i;
29         for (int j = 1; j<=prime[0 ]&& prime[j]<=MAXN/i; j++)
30         {
31             notprime[prime[j]*i] = true;
32             if (i%prime[j] == 0) break;
33         }
34     }
35 }
36
37 int fatCnt;
38 LL factor[1000][2];
39 void getFactors(LL n)
40 {
41     LL tmp = n;
42     fatCnt = 0;
43     for(int i = 1; prime[i]<=tmp/prime[i]; i++)
44     {
45         if(tmp%prime[i]==0)
46         {
47             factor[++fatCnt][0] = prime[i];
48             factor[fatCnt][1] = 0;
49             while(tmp%prime[i]==0) tmp /= prime[i], factor[fatCnt][1]++;
50         }
51     }
52     if(tmp>1) factor[++fatCnt][0] = tmp, factor[fatCnt][1] = 1;
53 }
54
55 int gcd(int a, int b)
56 {
57     return b==0?a:gcd(b, a%b);
58 }
59
60 int main()
61 {
62     getPrime();
63     int T, kase = 0;
64     scanf("%d", &T);
65     while(T--)
66     {
67         LL n;
68         scanf("%lld", &n);
69         getFactors(abs(n));
70         LL p = factor[1][1];
71         for(int i = 2; i<=fatCnt; i++)
72             p = gcd(p, factor[i][1]);
73
74         while(n<0 &&  p%2==0) p /= 2;
75         printf("Case %d: %d\n", ++kase, p);
76     }
77     return 0;
78 }