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

using namespace std;

int t = 43;
int fib[] = {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};

bool isFib(int x) {
	int s = 0, e = t-1;
	while (s <= e) {
		int m = (s+e) / 2;
		if (x == fib[m]) {
			return true;
		} else if (x < fib[m]) {
			e = m - 1;
		} else {
			s = m + 1;
		}
	}

	return false;
}

int main() {
	ios_base::sync_with_stdio(0);
	int z;
	cin >> z;
	for (int iz = 0; iz < z; iz++) {
		int n;
		cin >> n;
		bool f = false;
		if (n == 0) {
			f = true;
		} else {
			for (int i = 0; fib[i] * fib[i] <= n; i++) {
				if (n % fib[i] == 0) {
					if (isFib(n / fib[i])) {
						f = true;
						break;
					}
				}
			}
		}

		if (f) {
			cout << "TAK\n";
		} else {
			cout << "NIE\n";
		}
	}
	return 0;
}