#include <iostream>
#include <cmath>
using namespace std;
bool IsPrime(const int32_t num)
{
if(num < 2 || num == 4)
{
return 0;
}
else if(num == 2)
{
return 1;
}
else
{
for(int32_t idx = 2; idx <= floor(sqrt(num)); ++idx)
{
if(num % idx == 0)
{
return 0;
}
}
return 1;
}
}
int main()
{
int32_t nCases;
cin >> nCases;
int32_t num;
for(int32_t caseIdx = 0; caseIdx < nCases; ++caseIdx)
{
cin >> num;
bool isPrime = IsPrime(num);
if(isPrime)
{
cout << "TAK" << endl;
}
else
{
cout << "NIE" <<endl;
}
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y21hdGg+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKYm9vbCBJc1ByaW1lKGNvbnN0IGludDMyX3QgbnVtKQp7CiAgICBpZihudW0gPCAyIHx8IG51bSA9PSA0KQogICAgewogICAgICAgIHJldHVybiAwOwogICAgfQogICAgZWxzZSBpZihudW0gPT0gMikKICAgIHsKICAgICAgICByZXR1cm4gMTsKICAgIH0KICAgIGVsc2UKICAgIHsKICAgICAgICBmb3IoaW50MzJfdCBpZHggPSAyOyBpZHggPD0gZmxvb3Ioc3FydChudW0pKTsgKytpZHgpCiAgICAgICAgewogICAgICAgICAgICBpZihudW0gJSBpZHggPT0gMCkKICAgICAgICAgICAgewogICAgICAgICAgICAgICAgcmV0dXJuIDA7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICAgICAgcmV0dXJuIDE7CiAgICB9Cn0KCmludCBtYWluKCkKewogICAgaW50MzJfdCBuQ2FzZXM7CiAgICBjaW4gPj4gbkNhc2VzOwogICAgaW50MzJfdCBudW07CgogICAgZm9yKGludDMyX3QgY2FzZUlkeCA9IDA7IGNhc2VJZHggPCBuQ2FzZXM7ICsrY2FzZUlkeCkKICAgIHsKICAgICAgICBjaW4gPj4gbnVtOwogICAgICAgIGJvb2wgaXNQcmltZSA9IElzUHJpbWUobnVtKTsKICAgICAgICBpZihpc1ByaW1lKQogICAgICAgIHsKICAgICAgICAgICAgY291dCA8PCAiVEFLIiA8PCBlbmRsOwogICAgICAgIH0KICAgICAgICBlbHNlCiAgICAgICAgewogICAgICAgICAgICBjb3V0IDw8ICJOSUUiIDw8ZW5kbDsKICAgICAgICB9CiAgICB9CiAgICByZXR1cm4gMDsKfQ==