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
61
62
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;

public class ilo {
    protected static final int[] FIBS = {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};

    public static void main(String[] args) throws IOException {
        InputStream input = System.in;
        BufferedReader reader = new BufferedReader(new InputStreamReader(input));
        int trialsNumber = Integer.valueOf(reader.readLine());

        for (int t = 0; t < trialsNumber; t++) {
            int n = Integer.valueOf(reader.readLine());

            System.out.println(isTwoFibsMultiplied(n) ? "TAK" : "NIE");
        }
    }

    public static boolean isTwoFibsMultiplied(int n) {
        if (n == 0) {
            return true;
        }
        for (int fib : FIBS) {
            if (n % fib == 0) {
                if (isFib(n/fib)) {
                    return true;
                }
            }
        }

        return false;
    }

    public static boolean isFib(int n) {
        int left = 0, right = FIBS.length - 1;
        if (n == 0) {
            return true;
        }
        if (n > FIBS[right] || n < 0) {
            return false;
        }
        while (right - left > 1) {
            int middle = (right + left)/2;
            int middleValue = FIBS[middle];
            if (n > middleValue) {
                left = middle;
            } else if (n < middleValue) {
                right = middle;
            } else {
                return true;
            }
            if (n == FIBS[right] || n == FIBS[left]) {
                return true;
            }
        }
        return false;
    }
}