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
#include <iostream>
#include <math.h>

using namespace std;


bool is_prime(unsigned long long value) {
    unsigned long long i;

    if (value <= 3) return true;
    if (value % 2 == 0) return false;

    for (i = 3; i <= sqrt(value); i+=2) {
        if (value % i == 0)
            return false;
    }
    return true;
}


int main()
{
    unsigned long long input, l, r, s = 10;
    string result = "NIE";
    cin >> input;
    while (s < input) {
        l = input / s;
        r = input % s;
        s *= 10;
        if (r * 100 < s ) continue;
        if (is_prime(l) && is_prime(r)) {
            result = "TAK";
            break;
        }
    }
    cout << result << endl;
    return 0;
}