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
76
77
78
79
80
81
82
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <string>
#include <cstring>
using namespace std;

typedef long long int LL;
typedef long double LD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

const int INF = 1000000001;
const LD EPS = 10e-9;

#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 FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define MP make_pair
#define PB push_back
#define ST first
#define ND second
#define abs(a) ((a)<0 ? -(a) : (a))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))

const int MAX_F = 50;

int t;
LL n, fib[100];

int main()
{
	fib[0] = 0; fib[1] = 1;
	FOR(i, 2, MAX_F) 
	{
		fib[i] = fib[i-1] + fib[i-2];
		//cout << fib[i] << endl;
	}
	
	cin >> t;
	while(t--)
	{
		cin >> n;
		
		if(!n)
		{
			cout << "TAK" << endl;
			continue;
		}
		
		bool ok = 0;
		FOR(i, 1, MAX_F)
		{
			if(fib[i]*(n/fib[i]) == n && binary_search(fib+1, fib+MAX_F+1, n/fib[i]))
			{
				ok = 1;
				break;
			}
		}
		
		if(ok) cout << "TAK" << endl;
		else cout << "NIE" << endl;
	}
	system("pause");
	return 0;
}