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

template<class T>
bool is_prime(T number)
{
	if (number < 2)
	{
		return false;
	}

	for (T i = 2; i*i <= number; ++i)
	{
		if (number % i == 0)
		{
			return false;
		}
	}

	return true;
}

template<class T>
bool is_druga(T number)
{
	T left = number;
	T right = 0;
	T factor = 1;
	bool druga = false;

	while (left > 0)
	{
		T digit = left % 10;
		left /= 10;
		right += factor * digit;
		factor *= 10;

		if (digit != 0 && is_prime(left) && is_prime(right))
		{
			druga = true;
			break;
		}
	}

	return druga;
}

int main()
{
	long long number;

	scanf("%lld", &number);

	if (is_druga(number))
	{
		printf("TAK\n");
	}
	else
	{
		printf("NIE\n");
	}
}