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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include <stdio.h>

int fib[42]={	         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	};
//		1134903170 	};

int N[10];

int main()
{
	int t=0, n=0, i, j, k, l;
	int jest=0, wynik;

	scanf("%d",&t);
	for(int j=0;j<t;j++)
	{
		scanf("%d",&N[j]);		

	}
	for(int j=0;j<t;j++)
	{

		k=N[j];
		jest=0;
		i=0;
		while(fib[i]<k && i<42 && jest==0)
		{
			if(k%fib[i]==0) {
				wynik=k/fib[i];
				l=0;
				while(l<42) {
					if(wynik==fib[l]) jest=1;
					l++;
				}
			}
			i++;
		};


		i=0;
		while(fib[i]<=k && i<42)
		{
			if(fib[i]==k) {
				jest=1;
			}
			i++;
		};
		if(k==1) jest=1;

	 if(jest) printf("TAK\n"); else printf("NIE\n");
	}

	return 0;
}