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
#include <cmath>
#include <iostream>
#define ll long long

using namespace std;

void NIE();
void TAK();
bool IsPrime(ll a)
{
	if (a < 2)
		return false;
	if (a == 2)
		return true;
	if (a % 2 == 0)
		return false;
	for (ll i = 3; i <= sqrt(a); i += 2)
	{
		if (a % i == 0)
			return false;
	}

	return true;
}

int main()
{
	ll n;
	cin >> n;
	for (ll div = 10; div < n; div *= 10)
	{
		ll right = n % div, left = n / div;
		if (right >= div / 10 && IsPrime(left) && IsPrime(right))
		{
			TAK();
			return 0;
		}
	}

	NIE();
	return 0;
}

void NIE()
{
	cout << "NIE" << endl;
}

void TAK()
{
	cout << "TAK" << endl;
}