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
63
64
65
66
67
68
69
70
71
72
73
74
#include <cstdio>

using namespace std;
const int F[] =
{
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
};
int main()
{
    int t, n;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        if(n == 0)
        {
            printf("TAK\n");
            continue;
        }
        for(int i = 0; i < 43; ++i)
            if(n % F[i] == 0)
                for(int j = 0; j < 43; ++j)
                    if(F[i]*F[j] == n)
                    {
                        printf("TAK\n");
                        goto NEXT;
                    }
        printf("NIE\n");
        NEXT:;
    }
    return 0;
}