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

using namespace std;

#define MAX_N 1000000000

unsigned long long int tab[50];

int count = 0;

void generate()
{
	tab[0] = 0;
	tab[1] = 1;
	count = 2;
	while (tab[count - 1] < MAX_N)
	{
		tab[count] = tab[count - 1] + tab[count - 2];
		++count;
	}
}

void answer(unsigned long long int n)
{
	for(int i = 0; i < count; i++)
	{
		for(int j = 0; j < count; j++)
		{
			if(tab[i] * tab[j] == n)
			{
				printf("TAK\n");
				return;
			}
		}
	}
	printf("NIE\n");
	return;
}

int main()
{
	generate();
	int t;
	unsigned long long int n;
	scanf("%d", &t);
	while (t--)
	{
		scanf("%llu", &n);
		answer(n);
	}
	return 0;
}