1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
#include <cstdio>
#include <set>
using namespace std;
long long int fib[45]={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};
set<long long int> fi;
int t,w;
int main(){
	for(int i=0;i<45;++i){
		for(int j=0;j<45;++j){
			fi.insert(fib[i]*fib[j]);
		}
	}
	scanf("%d",&t);
	while(t--){
		scanf("%d",&w);
		if(fi.find(w)==fi.end()){
			printf("NIE\n");
		}else{
			printf("TAK\n");
		}
	}
	return 0;
}