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
69
70
71
72
73
74
75
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <bitset>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <iterator>
#include <tr1/unordered_map>

using namespace std;

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

#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(x,n) __typeof(n) x = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(c) ((int)(c).size())
#define FOREACH(i,c) for(VAR(i, (c).begin()); i!=(c).end(); ++i)
#define PB push_back
#define PF push_front
#define ST first
#define ND second
#define MP make_pair
#define MIN(a,b) ((a) < (b) ? (a) : (b))
#define MAX(a,b) ((a) > (b) ? (a) : (b))

#define N 1000000000
int fib[10000];

int
main()
{
  int t,n = 1;
  fib[0] = fib[1] = 1;

  while(fib[n++]<N)
    fib[n] = fib[n-1]+fib[n-2];
  scanf("%d", &t);
  REP(i,t){
    int x;
    scanf("%d", &x);
    if(x==0)
      printf("TAK\n");
    else {
      int j = 0, nie = 1;
      while(j<n){
        if(x%fib[j]==0){
          int *p = find(fib, fib+n,x/fib[j]);
          if(fib[*p]==x/fib[j]){
            printf("TAK\n");
            nie = 0;
            break;
          }
        }
        ++j;
      }
      if(nie)
        printf("NIE\n");
    }

  }

  return 0;
}