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
aashish_a2z:
20181214 23:16:16
AC in one go...Observe the pattern.


piyushchavan88:
20181214 18:41:12
Use mp boost library of c++ for input.


daku5768:
20181214 12:32:43
if anywhere in loop if n is divisible by 3 ,print NIE and return 

laidactienbn:
20181123 15:00:58
This is such an interesting prob.


priyanshu_pg:
20181117 11:53:25
I am maintaining a set and checking whether the no has earlier occurred in set or not. In case a no repeats itself, I am breaking the loop for NIE. Still I am getting WA. Kindly help 

knakul853:
20181031 16:37:44
69th 

aamir4813:
20181017 07:50:22
very Easy Problem


adipat:
20181009 14:46:58
Just run the loop and if at any point you find that n is divisible by 12, the loop will never terminate (12,6,3,12,6,3,..) pattern repeats. One other way is to check if the number is a power of 2, but I haven't tested this method. 

ankit_mnnit:
20180929 14:52:44
Only Check power of 2 or not 

dewa251202:
20180928 15:02:28
Testing my FTH 
Added by:  Krzysztof Lewko 
Date:  20111109 
Time limit:  0.906s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  AMPPZ 2011 