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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef pair<int, int> PI;
typedef long long LL;
#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define MP make_pair
#define ST first
#define ND second
const int INF = 1000000001;
const double EPS = 10e-9;

void Fibonacci(set<int> &k)
{
    VI tab;
    tab.PB(0);
    tab.PB(1);
    while(tab.back() < INF) tab.PB(tab[SIZE(tab) - 1] + tab[SIZE(tab) - 2]);
    REP(x, SIZE(tab)) REP(y, SIZE(tab)) k.insert(tab[x] * tab[y]);
}

int main()
{
    int n, b;
    set<int> k;
    scanf("%d", &n);
    Fibonacci(k);
    REP(x, n)
    {
        scanf("%d", &b);
        if(k.find(b) == k.end()) printf("NIE\n");
        else printf("TAK\n");
    }
    return 0;
}