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

mhto: 2017-03-18 13:59:53

Think Simple. No Game Theory, No factorization :D

cake_is_a_lie: 2017-03-03 18:37:25

I implemented fast, sive-based 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.

HINT: An odd number will never have even divisors, while every number has 1 as a divisor.

Last edit: 2017-03-03 18:39:39
adihaya: 2016-12-30 07:09:29

always remember your endl's xD

suvro_datta: 2016-10-17 09:18:33

even /odd problem.. :)

ashishranjan28: 2016-09-22 19:12:07


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

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