SHAKTI  SHAKTIMAN AND KILWISH
Since very long time shaktiman and kilwish have been fighting with each other but the fight never came to end . So finally I came to rescue . I decided that the result of the fight will be decided by a mathematical game, in which I will write a number (N) . Kilwish and shaktiman will play the game alternatively and each of them would subtract a number(n) [n is less than N] such that N modulo n gives zero. The game is repeted turn by turn until the one, who now cannot make a further move looses the game
Shaktiman being weak at mathematics asks you for help, whether or not he can win in that particular case. If Shaktimaan wins that game then print "Thankyou Shaktiman" otherwise print "Sorry Shaktiman".The game begins with shaktimaan playing first move.It is well understood that both of them will make moves in optimal way.
INPUT
Input contains test cases t (< 10^5) and followed by t numbers (1 <= N <= 10^6 ).
OUTPUT
If Shaktimaan wins that game then print "Thankyou Shaktiman" otherwise print "Sorry Shaktiman".
Sample Input: 2 212 424 Sample Output: Thankyou Shaktiman Thankyou Shaktiman
hide comments
ashishranjan28:
20160922 19:12:07
lol 

aditya1997:
20160820 20:44:08
easiest on spoj !!!! XD 

rayhan50001:
20160614 00:13:04
Easy One Ac in 1st Go... :D 

vikikkdi:
20160306 05:50:41
think a solution with bitwise operator:) ac in one go 

sharath_111:
20160128 20:11:54
easy one,think u will get.my 22 nd :)


akshayvenkat:
20151222 18:17:01
//PLEASE READ ONLY IF YOU DIDN'T UNDERSTAND THE PROBLEM. WARNING SPOILER!//


ashuamit:
20151201 12:48:03
how 212 is thankyou shaktima plz elaborate once . thanking u in advance :)


dwij28:
20150824 21:30:09
Beautiful Concept ?? Game Theory ?? Algorithms ?? What are you guys talking about ?? This question can be solved in 2 lines in python. 

iharsh234:
20150810 22:12:08
cant get what everyone talking about i got AC within 10 min just by checking odd/even.


Anik Dasgupta:
20150807 18:39:53
does anybody know how to solve this question ? please email me if you do. thank you :) 
Added by:  aqfaridi 
Date:  20140124 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 