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
mirfanf: 2019-02-04 10:17:26


pyqe: 2019-02-04 10:17:13


Last edit: 2019-02-04 10:18:03
awidardi: 2019-02-04 10:16:48

retarded problem

nitinsrt: 2019-01-02 18:20:13

i got WA just bcoz i wrote thankyou shaktiman and sorry shaktiman in small letters .. lol!

rajcoolaryan: 2018-06-28 06:53:51

odd and even

ajayc1007: 2018-06-12 19:48:25

Odd Even. Thanks @akshayvenkat (snr) !

hwb_worwa: 2018-05-11 00:57:25

WA because I misspelled Shaktiman. :(

sandilya1599: 2018-01-12 15:29:35


sharif ullah: 2018-01-06 11:31:39

its game theory problem !!!!!!!!!!!1 LOL'
just draw a tree for number 1->4 and everyone play optimally,,,u will get a pattern

firoda: 2017-07-29 08:03:52

I have created a simple even odd program in this case with a long unsigned int in C++
It is showing the wrong answer

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