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
mhto:
20170318 13:59:53
Think Simple. No Game Theory, No factorization :D 

cake_is_a_lie:
20170303 18:37:25
I implemented fast, sivebased factorization and generation of all divisors, DP and got AC in 0.12; then I looked at the top times and printed out the winner for 1..1000; now I feel dumb :p.


adihaya:
20161230 07:09:29
always remember your endl's xD 

suvro_datta:
20161017 09:18:33
even /odd problem.. :) 

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!//

Added by:  aqfaridi 
Date:  20140124 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 