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
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
//Potyczki 2014 runda probna

#include <vector>
#include <iostream>
using std::vector;
using std::cin;
using std::cout;
using std::endl;
using std::ios_base;

enum STAN { TAK, NIE };
STAN odp;

int fibs[] = {
	0,
	1,
	2,
	3,
	5,
	8,
	13,
	21,
	34,
	55,
	89,
	144,
	233,
	377,
	610,
	987,
	1597,
	2584,
	4181,
	6765,
	10946,
	17711,
	28657,
	46368,
	75025,
	121393,
	196418,
	317811,
	514229,
	832040,
	1346269,
	2178309,
	3524578,
	5702887,
	9227465,
	14930352,
	24157817,
	39088169,
	63245986,
	102334155,
	165580141,
	267914296,
	433494437,
	701408733 };

vector<int> fiby(fibs,fibs+sizeof(fibs)/sizeof(int)); //liczby Fibo

/*
int fib(int n)
{
	int p = 0, r = 1, f = 1;
	for (int a = 0; a < n; a++)
	{
		f = p + r;
		p = r;
		r = f;
	}
	return f;
}*/

int main(int,char**)
{
	ios_base::sync_with_stdio(0);
	int t = 0, w = 0;
	cin>> t;
	while (t--)
	{
		cin >> w;
		for (auto it = fiby.end()-1; it != fiby.begin(); it--)
		{
			int d = (*it);
			if (d > w || w%d != 0)
				continue;
			odp = NIE;
			for (const auto& i : fiby)
			{
				if (i*d == w)
				{
					odp = TAK;
					break;
				}
				else
					continue;
			}
			if (odp == TAK)
				break;
		}
		if (odp == TAK)
			cout << "TAK" << endl;
		else
			cout << "NIE" << endl;
	}
	return 0;
}