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
#include <iostream>

long int tablicaF[] = {
	0, 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 };

long int Liczba(long int f1, long int f2)
{
	return f1+f2;
}

bool sprawdzLiczbe(long int n)
{
	int max=0, min=1;
	while( max < 44 && tablicaF[max] < n)
	{
		if(tablicaF[max] == n)
			return true;
		++max;
	}
	if(max == 44)
		max = 43;
	while(min <= max)
	{
		if(n%tablicaF[min] == 0)
		{
			long long wyn  = (long long)tablicaF[max]*(long long)tablicaF[min];
			while(wyn >= n ) { 
				if(wyn == n)
					return true;
				wyn  = (long long)tablicaF[max]*(long long)tablicaF[min];
				max-=1;
			}
			++min;
		}
		else
			++min;
	}
	return false;

}

int main() {
	int n;
	std::cin >> n;
	for(int i = 0; i < n; ++i)
	{
		long int d = 0; 
		std::cin >> d;
		if(sprawdzLiczbe(d))
		{
			printf("TAK\n");
		}
		else
			printf("NIE\n");
	}
	return 0;
}