SP25214 OHANIGAME - Ohani And The Game

One day Ohani and her friend was playing a game. The rules of the game is given below: 1. Ohani Starts the game. Then the two player take turns. 2. At the starting of the game, Ohani and her friend together choose a number N. 3. They take the absolute value of N , N = |N| or, N = abs(N). 4. In one turn: a player chooses a divisor X of N where 1 < X 10->5->1 and 20->5->1, both the way has number 5 in common. But: 20->10->1 and 20->4->2->1 has no number common without 20 and 1. So, now Ohani wants to know the number of ways such that no two way has common number except 1 and N. But Ohani is very weak in coding. So, she wants you to help.

The first line of the input contains the number of testcases T (

For each testcase, output the desired answer. If it is impossible to reach 1, just print “Impossible”.