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
#include<iostream>
using namespace std;

unsigned long long tab[100]={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,0,0,0,0};
unsigned long long iloczyny[45*45];
void fibonacci()
{    
int k=0;
   for(int i=0;i<44;i++)
   	for(int j=0;j<44;j++)
   	{
   		iloczyny[k++]=tab[i]*tab[j];
   	//	cout<<iloczyny[k-1]<<endl;
   	}
}

bool czy_jest(unsigned long long n)
{
	for(int i=0;i<1936;i++)
		if(iloczyny[i]==n)return 1;
		return 0;
}
int main()
{
	int t;
	unsigned long long n;
	fibonacci();
	cin>>t;
	while(t--)
	{
		cin>>n;
		if(n==0)
			cout<<"TAK\n";
		else
			if(czy_jest(n))
				cout<<"TAK\n";
			else
				cout<<"NIE\n";
			
	}
	return 0;
}