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
54
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class ilo {

	
	
	public static void main(String[] args) {
		
		Integer[] fib = new Integer[] {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, 1134903170};
		
		Set<Integer> fibSet = new HashSet<>(Arrays.asList(fib));
		
		Scanner scanner = new Scanner(System.in);
		
		int t = scanner.nextInt();
		
		mainLoop : for (int i = 0; i < t; i++) {
			
			int n = scanner.nextInt();
			
			if (fibSet.contains(n)) {
				System.out.println("TAK");
				continue;
			}
			
			// otherwise check dividants:
			
			int k = 0;
			int len = fib.length;
			
			while (n >= fib[k] && k < len) {
				double quotient = (double) n / fib[k];
				if (quotient == Math.round(quotient) && fibSet.contains(((int) quotient))) {
					System.out.println("TAK");
					continue mainLoop;
				}
				k++;
			}
			
			System.out.println("NIE");
		}
		
		scanner.close();
		
	}
	
}