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

using namespace std;

#define PB push_back
#define FORE(i, t) for(__typeof(t.begin())i=t.begin();i!=t.end();++i)
#define SZ(x) int((x).size())
#define REP(i, n) for(int i=0,_=(n);i<_;++i)
#define FOR(i, a, b) for(int i=(a),_=(b);i<=_;++i)
#define FORD(i, a, b) for(int i=(a),_=(b);i>=_;--i)

#ifdef DEBUG
#define DEB(x) (cerr << x)
#else
#define DEB(x)
#endif

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int INF = 1e9 + 9;

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

bool is_double_prime(string s) {
    FOR (i, 1, SZ(s) - 1) {
        if (s[i] == '0') {
            continue;
        }
        ll a = stoll(string(s.begin(), s.begin() + i));
        ll b = stoll(string(s.begin() + i, s.end()));
        DEB(a << " " << b << "\n");
        if (a > b) {
            swap(a, b);
        }
        if (is_prime(a) && is_prime(b)) {
            return true;
        }
    }
    return false;
}

void inline one() {
    string n;
    cin >> n;
    cout << (is_double_prime(n) ? "TAK" : "NIE") << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    //int z; cin >> z; while(z--)
    one();
}