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
#include<iostream>
#include<unordered_map>
using namespace std;

static const int FIB[] = {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};
static const int L = 43;

int main() {
    
    
    unordered_map<int, int> fibmap;
    
    for (int i = 0; i < L; i++) fibmap.insert(make_pair(FIB[i], FIB[i]));
    
    int z;
    cin >> z;
    while (z--) 
    {
        int a;
        cin >> a;
        if (a == 0)
        {
            cout << "TAK" << endl;            
            continue;
        }
        int flag = 0;
        for (int i = 0; i < 43; i++)
        {                
            int m = a % FIB[i];
            if (m) continue;
            int d = a / FIB[i];
            if (fibmap.find(d) != fibmap.end())
            {
                cout << "TAK" << endl;                
                flag = 1;
                break;
            }
        }
        if (!flag) cout << "NIE" << endl;
    }
    return 0;
}