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 contains test cases t (< 10^5) and followed by t numbers (1 <= N <= 10^6 ).


If Shaktimaan wins that game then print "Thankyou Shaktiman" otherwise print "Sorry Shaktiman".

Sample Input:

Sample Output:
Thankyou Shaktiman
Thankyou Shaktiman

hide comments
aditya1997: 2016-08-20 20:44:08

easiest on spoj !!!! XD

rayhan50001: 2016-06-14 00:13:04

Easy One Ac in 1st Go... :D

vikikkdi: 2016-03-06 05:50:41

think a solution with bitwise operator:-) ac in one go

sharath_111: 2016-01-28 20:11:54

easy one,think u will 22 nd :)

akshayvenkat: 2015-12-22 18:17:01


case N=212.
shaktiman plays first. he chooses 'n' and subtracts it from 212. we shall assume he begins with 1. now N=211.
Kilwish subtracts 1 again, now N=210.
this goes on until N=1, after which subtraction from N is impossible(remember, n<N).
So the one who reaches N=1 first wins.

if N=6
move 1: N=5 (By Shakti)
move 2: N=4(By Kilwish)
move 3: N=3 (By Shakti)
move 4: N=2(By Kilwish)
move 5: N=1 (By Shakti)

Shaktiman reached N=1 first. So he wins.

Work out another sample and you'll crack the logic :)

ashuamit: 2015-12-01 12:48:03

how 212 is thankyou shaktima plz elaborate once . thanking u in advance :)

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

Added by:aqfaridi
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)