SPOJ in Gyumri

   A cyclic number is an integer n digits in length which, when multiplied by any integer from 1 to n, yields a “cycle” of the digits of the original number. That is, if you consider the number after the last digit to “wrap around” back to the first digit, the sequence of digits in both numbers will be the same, though they may start at different positions.

   For example, the number 142857 is cyclic, as illustrated by the following table:

142857 × 1 = 142857

142857 × 2 = 285714

142857 × 3 = 428571

142857 × 4 = 571428

142857 × 5 = 714285

142857 × 6 = 857142

   Write a program which will determine whether or not numbers are cyclic.

Input.

   The input will begin with a single integer P on the first line, indicating the number of cases that will follow.

   The remaining lines of the input will consist of one integer per line, from 2 to 60 digits in length. (Note that preceding zeros should not be removed, they are considered part of the number and count in determining n. Thus, “01” is a two-digit number, distinct from “1” which is a one-digit number.)

Output.

   For each input integer, write a line in the output indicating whether or not it is cyclic.

Sample test.