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
/*
 *  Copyright (C) 2014  Paweł Widera
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details:
 *  http://www.gnu.org/licenses/gpl.html
 */

#include <vector>
#include <unordered_set>
#include <iostream>
using namespace std;

int main() {
	int n;
	unsigned long long int number;

	ios::sync_with_stdio (false);
	cin >> n;

	vector<unsigned long long int> fibonacci;
	fibonacci.push_back(0);
	fibonacci.push_back(1);

    while (true) {
		auto fib = fibonacci[fibonacci.size() - 2] + fibonacci[fibonacci.size() - 1];
		if (fib > 1000000000) {
			break;
		}
		fibonacci.push_back(fib);
    }

	unordered_set<unsigned long long int> set;
	for (auto fib : fibonacci) {
		set.insert(fib);
	}

	for (int i = 1; i <= n; ++i) {
		cin >> number;

		auto possible = false;
		for (unsigned int j = 2; j < fibonacci.size(); ++j) {
			auto f = fibonacci[j];
			if (f < number && number % f == 0) {
				auto other = number / f;
				if (set.count(other) > 0) {
					possible = true;
					break;
				}
			}
		}

		if (possible) {
			cout << "TAK" << endl;
		} else {
			cout << "NIE" << endl;
		}
	}
	return 0;
}