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
//Dawid Dworak
#include <iostream>
using namespace std;
long long unsigned int fib[40]={0, 1, 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};
bool p(long long unsigned int n){
    long long unsigned int k;
    for(int i=0,j=39; i<=j;){
        k=fib[i]*fib[j];
        if(k<n)i++;
        else if(k>n)j--;
        else return true;
    }
    return false;
}
int main(){
    ios_base::sync_with_stdio(0);
    int n;
    long long unsigned int x;
    cin >> n;
    for(int i=0;i<n;i++){
        cin >> x;
        if(p(x))cout << "TAK\n";
        else cout << "NIE\n";
    }
}