P1021 Mission 1 - IV : Final Meet

Problem Background

Radar finally survives from the explodes! Suddenly, a boy jump off a helicopter from the sky and with an umbrella, he landed safely. Radar looks at the boy cautiously. It is Cui2010!

• Ah, finally found me? Oh, you know I’m kind of vegetable… So if you can figure this out, I’ll never Orz!

Problem Statement

Cui2010 give Radar a final problem. Radar must figure it out or he must Orz to Cui2010.

Now there are \(n\) IOI competitions, CZY and GZK wants to AK them. The people who AK the last IOI ( IOI is self-pausing?) is who Jerrlee will Orz to.

BUT...

They can only AK \(x^y\) IOI’s at a time. (\(x\) is prime, \(y \geq 0\), \(x^y\) is less than the remain IOI field number)

Input

First line contains a single number — \(t\), means there are \(t\) test cases.

Next are \(t\) test cases, each case contains one line with one number \(n\) for the current test case.

Output

The Output contains \(t\) lines, the \(i^{\rm th}\) line contains the answer of the \(i^{\rm th}\) test case.

Each line contains one of these: CZY AK IOI!!! or GZK AK IOI!!!.

Constraints

• \(1 \leq t \leq 10^7\).
• For any of the \(t\) test cases, \(1 \leq n \leq 9 \times 10^7\).

Samples

Input 1

3
5
6
7

Output 1

CZY AK IOI!!!
GZK AK IOI!!!
CZY AK IOI!!!