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<=10^14.

Output

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

Example

Input:
4

Output:
TAK

hide comments
aman_atg: 2019-09-11 20:06:30

ac in one go..

rahulsinghk: 2019-08-05 18:20:04

haha! just observe the pattern and use the same code to check.

shreyas_s: 2019-08-01 16:28:54

No array , floor or ceil required.
Just observe the pattern !!!

vamsi99: 2019-08-01 12:31:18

AC in one go!

vurise18: 2019-06-28 16:47:32

WA in 20th testcase

ankyy_0103: 2019-06-28 13:41:38

I am getting WA in 18th case ,i am using floor(log(n)/log(2))==ceil(log(n)/log(2)) ,what is going wrong here

thanusha12: 2019-06-02 09:25:42

AC in one go,just need to check whether the number is multiple of two or not

ambuj2512: 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 . :)

hetp111: 2019-04-25 18:09:50

Last edit: 2019-04-25 19:52:22
klmo: 2019-04-19 18:58:58

Anyone getting WA when using BigInteger and BigInteger.and() in java to check if n=2^k ?


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