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
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <utility>
#include <stack>

using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;
#define MP make_pair
#define FOR(v,p,k) for(int v=(p);v<=(k);++v)
#define FORD(v,p,k) for(int v=(p);v>=(k);--v)
#define REP(i,n) for(int i=0;i<(n);++i)
#define VAR(v,i) __typeof(i) v=(i)
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define SIZE(x) (int)x.size()
#define ALL(c) c.begin(),c.end()

#define ODD(x) ((x)%2)
#define EVEN(x) (!(ODD(x)))

VI good;

LL MAX_FIB = 1000000000LL;

void fillGood() {
  VI fibs;
  fibs.push_back(0);
  fibs.push_back(1);
  int next = 1;
  while (next <= MAX_FIB) {
    fibs.PB(next);
    next = fibs[fibs.size()-1] + fibs[fibs.size()-2];
  }
  REP(i, fibs.size()) REP(j, fibs.size()) {
    if ((LL) fibs[i] * fibs[j] <= MAX_FIB) good.PB(fibs[i]*fibs[j]);
  }
  sort( good.begin(), good.end() );
  good.erase( unique( good.begin(), good.end() ), good.end() );
}

int solve(int n) {
  return find(good.begin(), good.end(), n) != good.end();
}

int main() {
  fillGood();
  int t;
  scanf("%d\n", &t);
  FOR(tt,1,t) {
    int n;
    scanf("%d", &n);
    printf("%s\n", solve(n)?"TAK":"NIE");
  }
  return 0;
}