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

using namespace std;

typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> para;

#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 ST first
#define ND second
#define MP make_pair

#define M0 31622
#define M 1000000000


int main() {
  int a=1, b=2, c=3, t, n;
  set<int> s;
  VI v;

  s.insert(1); s.insert(2);

  while (c<=M0) {
    s.insert(c);
    v.PB(c);
    a=b; b=c; c=a+b;
  }

  while (c<=M) {
    s.insert(c);
    a=b; b=c; c=a+b;
  }

  cin>>t;

  REP(i,t){
    cin>>n;
    if (n<7) {cout<<"TAK\n"; continue;}

    FOREACH(i,v)
      if (n%*i==0 && s.find(n/(*i))!=s.end()) {cout<<"TAK\n"; goto JEST;}

    cout<<"NIE\n";


JEST: ;
  }

  return 0;
}