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
#include <iostream>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    long long tab[] = {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, 2718309, 3524578, 5702877, 9227465, 14930352, 24157817, 39088169, 63245986};
    long long n;
    int p;
    cin >> p;
    for (int i = 0; i < p; i++)
    {
        cin >> n;
        bool czy = false;
        for (int j = 0; j < 38; j++)
        {
            if (n % tab[j] == 0)
            {
                for (int k = 1; k < 38; k++)
                {
                    if ((n / tab[j]) == tab[k])
                    {
                        czy = true;
                    }
                }
            }
            if (czy)
                break;
        }
        if (czy)
        {
            cout << "TAK" << endl;
        }
        else
            cout << "NIE" << endl;
    }
    return 0;
}