WILLITST - Will it ever stop

When Bob was in library in University of Warsaw he saw on one of facades caption :"Will it ever stop?" and below some mysterious code:

while n > 1
  if n mod 2 = 0 then
    n := n / 2
  else
    n := 3 * n + 3

Help him finding it out !

Input

In first line one number n ≤ 1014.

Output

Print "TAK" if program will stop, otherwise print "NIE"

Example

Input:
4

Output:
TAK

Added by:Krzysztof Lewko
Date:2011-11-09
Time limit:0.906s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:AMPPZ 2011

hide comments
2019-12-12 05:24:41
haha this comment section is full of spoilers


Last edit: 2019-12-12 05:25:48
2019-11-14 17:16:53
haha vodox
2019-08-05 18:20:04
haha! just observe the pattern and use the same code to check.
2019-08-01 16:28:54
No array , floor or ceil required.
Just observe the pattern !!!
2019-06-28 16:47:32
WA in 20th testcase
2019-05-25 21:02:06
very simple no need for for any bitwise and condition just take a array and check whether number repeat or not . :)
2019-04-19 18:58:58
Anyone getting WA when using BigInteger and BigInteger.and() in java to check if n=2^k ?
2019-03-29 12:23:32
why is log floor and ceil combination giving wrong ans in c
2019-01-23 17:06:48
c++ just two lines of code ,
think the advantage of floor,ceil function and logarithm.
2019-01-14 19:19:21
Check For case <=1 and simple logic
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.