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
Shreya Inamdar: 2012-03-09 09:02:09

my solution runs fine till 16th test case...but then wa.?!?

changed my algo now.
if you are using python, try to avoid using floating point numbers in the program...they violate some testcases...

Last edit: 2012-03-19 05:47:29
CryptoViral: 2012-03-04 16:54:55

easy but see the input size and inputs being given carefully

Nirwan Dogra : 2012-02-16 20:57:07

wat to with 0 and 1?

Abhishek Verma: 2012-01-28 18:49:04

interesting and easy problem :)
gt ac in first attempt

(^@_^@): 2012-01-24 14:21:51

smallest code i have ever written in spoj
& got accepted

ramaravind: 2012-01-03 18:02:16

what is the mistake in my code???i checked the divisibility of
n by 2 and 3 ...

Last edit: 2012-01-03 18:03:47
xyz: 2011-12-26 15:03:17

hey i am getting wa .. using logic of odd and even number.. is there more test case..

Last edit: 2011-12-26 15:03:48
Devil D: 2011-12-13 10:55:42

Smallest code i have ever written :)

LeppyR64: 2011-11-20 16:17:41

Read the problem statement it explains clearly what to do for 0 and 1.

Gaith Hallak: 2011-11-19 22:42:12

if (n = 1) or (n = 0) what the answer should be ?


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