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
// PA 2014 runda probna, zadanie Iloczyn
// Nikodem "nixon" Kramarz

#include <iostream>
using namespace std;

long long t, n;
long long fibo[50] = {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};

int main()
{
    ios_base::sync_with_stdio(0);
    cin >> t;
    while(t--)
    {
        cin >> n;

        if(n == 0 || n == 1)
        {
            cout << "TAK\n";
            continue;
        }


        bool p=0;
        for(int i=0; i<44; i++)
        {
            for(int j=i; j<44; j++)
            {
                if(fibo[i] * fibo[j] == n)
                {
                    p=1;
                    cout << "TAK\n";
                    break;
                }
            }
            if(p)
                break;
        }

        if(p)
        {
            p=0;
            continue;
        }
        cout << "NIE\n";
    }
}