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
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <iostream>
#include <map>


using namespace std;

#define REP(i,n) for(int i=0; i<(int)n; i++)
#define ST first
#define ND second
#define MP make_pair
#define PB push_back

typedef vector<int> VI;
typedef pair<int,int> PI;
typedef vector<PI> VPII;
typedef set<int> SI;
typedef long long LL;

#ifdef DEBUG
const bool debug = true;
#else
const bool debug = false;
#endif
int m, l, test = 1;
const int inf = 1000 * 1000 * 1000 ;
const int MAKSN = 1000 * 1000 + 13; // UZUPElnic

LL n;
string s;

void readIn()
{
	cin >> n;
	s = std::to_string(n);
}


bool isPrime(long long k) {

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

	return true;
}

bool check(int l){
	long long left = 0, right = 0;
	for(int i = 0; i < l; i++){
		left *= 10;
		left += s[i] - '0';
	}
	for(uint i = l; i < s.size(); i++){
		right *= 10;
		right += s[i] - '0';
	}

	// cerr << left <<" " << isPrime(left) << " " << right << " " << isPrime(right) << "\n";

	if(left < right && isPrime(left) && isPrime(right))
		return true;

	if(isPrime(right) && isPrime(left))
		return true;

	return false;
}


void solve()
{
	// cout << s << " " << n << "\n";

	for(uint i = 1; i < s.size(); i++) { // MAX Dl 12
		if(s[i] == '0')
			continue;
		if(check(i))
		{
			cout << "TAK\n";
			return;
		}

	}

	cout << "NIE\n";
}

void zeruj()
{
}

int main()
{
	ios_base::sync_with_stdio(0);

	// cin >> test;
    // REP(i, test)
    // {
    zeruj();
    readIn();
    solve();
    // }

    return 0;
}