Advertisement blocking software were detected ;( Please add this webpage to whitelist.

SHAKTI - SHAKTIMAN AND KILWISH

no tags 

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


Added by:aqfaridi
Date:2014-01-24
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel Pentium G860 3GHz)
Languages:All

hide comments
dwij28: 2015-08-24 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: 2015-08-10 22:12:08

cant get what everyone talking about i got AC within 10 min just by checking odd/even.

Anik Dasgupta: 2015-08-07 18:39:53

does anybody know how to solve this question ? please email me if you do. thank you :)

(Tjandra Satria Gunawan)(曾毅昆): 2015-08-03 14:16:10

Submit bruteforce algo ==> AC
find pattern based on my bruteforce algo, submit that pattern ==> AC
What an easy problem :p

Anant Upadhyay: 2015-08-02 07:21:21

nice question!

Anurag Sharma: 2015-08-01 16:18:15

learnt game theory :)

anuveshkothari: 2015-07-16 06:17:34

its not easy for me, i don't know how others find it easy..

Poonam: 2015-07-05 16:17:07

i didn't get the question...can someone help in understanding it

Dushyant Singh: 2015-03-30 20:15:12

I found this very helpful for this problem - https://www.youtube.com/watch?v=-8H15d5ibW4

Last edit: 2015-08-11 17:38:01
Mitch Schwartz: 2014-12-29 06:39:01

It's possible that some people misunderstood the question, as it is not written very precisely. To clarify: At the start of the game, Shaktiman chooses some positive integer n<N such that N modulo n gives zero (if such an n exists), then he replaces N with N' = N-n, and in the following turn Kilwish will choose an n'<N' such that N' modulo n' gives zero (if such an n' exists), etc.

Last edit: 2014-12-29 06:49:21