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
#include <bits/stdc++.h>

using namespace std;

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

int main() {

	string n;
	cin >> n;

	for (int i = 0; i < n.size(); i++) {
		string left = n.substr(0, i), right = n.substr(i);
		if (left.empty() || right.empty() || right[0] == '0') {
			continue;
		}
		stringstream leftStream(left), rightStream(right);
		long long leftNum, rightNum;
		leftStream >> leftNum;
		rightStream >> rightNum;
		if (isPrime(leftNum) && isPrime(rightNum)) {
			cout << "TAK" << endl;
			return 0;
		}
	}

	cout << "NIE" << endl;

	return 0;
}