This is for C programming language

Jojo got a punishment from his teacher because he is naughty. He needs to write N times of "I will become a good boy.". It's very troublesome. To make it easier, he will create a program that can do his task. He will skip every composite line number to reduce the usage of paper (He needs to print in paper). Help him!

Format Input: The first line of a input file is an integer T, then followed by T numbers of N indicating the number of times Jojo need to write.

Format Output: Please refer to the description for the output format.

Constraints: 1 <= T <= 10 1 <= N <= 1000

Sample Input | Sample Output

2 |

4 | Case #1:[ ]I will become a good boy.[ ]I will become a good boy.

2 | Case #2: I will become a good boy.

Note: Composite number is a non-prime number