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
55
56
57
58
59
60
package runda.probna;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class ilo {

	public static void main(String[] args) {
		
		Scanner scanner = new Scanner(System.in);
		int times = scanner.nextInt();
		String res = null;
		for (int i = 0; i < times; i++) {
			int curr = scanner.nextInt();
			if (curr < 3)
				res = "TAK";
			else {
				List<Integer> lowers = computeLowerFibs(curr);
				res = isGivenNumberFibProduct(lowers, curr) ? "TAK" : "NIE";
			}
			System.out.println(res);
		}
	}
	
	private static List<Integer> fibs = Arrays.asList(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);
	
	private static List<Integer> computeLowerFibs(int n) {
		List<Integer> lowers = new ArrayList<Integer>();
		for (int i = 0; i < fibs.size(); i++) {
			int curr = fibs.get(i);
			if (curr <= n)
				lowers.add(curr);
			else
				break;
		}
		return lowers;
	}
	
	private static boolean isGivenNumberFibProduct(List<Integer> lowers, int n) {
		for (int i = lowers.size() - 1; i >= 0; i--) {
			int curr = lowers.get(i);
			if(lowers.contains(n)) return true;
			if (n % curr == 0) {
				int candidate = n / curr;
				if (lowers.contains(candidate)) {
					return true;
				} else
					lowers.remove(curr);
			}
		}
		return false;
	}
}