1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
#define REP(I,N) for(int I = 0; I < N; ++I)
#define REPN(I,N) for(int I = 1; I <= N; ++I)
using namespace std;
typedef vector<int> VI;

int main()
{
	int fibo[] = {1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733};
	int T, n;
	
	scanf("%d", &T);
	while(T--)
	{
		scanf("%d", &n);
		
		if(n==0) printf("TAK\n");
		else
		{
			REP(k,2)
			{
				for(int i = 42; i >= 0; --i)
				{
					if(n%fibo[i]==0) {n/=fibo[i]; break;}
				}
			}
			if(n==1) printf("TAK\n");
			else printf("NIE\n");
		}	
	}
}