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

const int fibTab[] = { 0, 1, 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 };
const int fibCount = 45;

bool isProduct(int n) {
	int squareRoot = sqrt(n) + 1;
	if (n == 0) return true;
	else {
		bool isProduct = false;
		for (int i = 1; fibTab[i] <= squareRoot && i < fibCount && !isProduct; ++i){
			if (n % fibTab[i] == 0 && binary_search(fibTab + 1, fibTab + fibCount, n / fibTab[i])){
				isProduct = true;
			}
		}
		return isProduct;
	}
}

int main() {

	int t;
	cin >> t;
	for (int i = 0; i < t; ++i){
		int n;
		cin >> n;
		if (isProduct(n)) cout << "TAK\n";
		else cout << "NIE\n";
	}

	return 0;
	
}