There are infinitely many lamps, all initially turned off. At each phase of the game, all lamps whose numbers are divisible by the phase number are toggled: if a lamp is off, it is turned on; if it is on, it is turned off.
The first line contains the number of test cases (1 \le t \le 10). Each of the following lines contains the number (0 < n \le 10^5) representing the phase number of the game.
For each test case, print one line indicating the state of lamp number after phase of the game: — the lamp is off, — the lamp is on.
Example 1