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
#include <iostream>

bool is_prime(long long n) {
  for (int i = 2; i * i <= n; ++i) {
    if (n % i == 0) return false;
  }
  return true;
}

int main() {
  long long n;
  std::cin >> n;
  
  long long right = n % 10;
  long long left = n / 10;
  long long power = 1;
  int last_digit = right;

  while (left > 0) {
    if (last_digit != 0 && is_prime(left) && is_prime(right)) {
      std::cout << "TAK";
      return 0;
    }
    last_digit = left % 10;
    power *= 10;
    right = right + power * (left % 10);
    left /= 10;
  }
  std::cout << "NIE";

  return 0;
}