401572: GYM100495 D Modulo maths

Birute loves modular arithmetics, but hates long problem statements.

Given n, find f(n).

The first line contains the number of test cases T (T ≤ 50). In the following T lines there are integer values of number n (1 ≤ n ≤ 10007).

For each test case output one line containing “Case #tc: num”, where tc is the number of the test case (starting from 1) and num is the value of f(n).

2
1
2

Case #1: 1
Case #2: 0

Fun fact: 1 is neither prime nor composite number.