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
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <utility>
#include <stack>

using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;
#define MP make_pair
#define FOR(v,p,k) for(int v=(p);v<=(k);++v)
#define FORD(v,p,k) for(int v=(p);v>=(k);--v)
#define REP(i,n) for(int i=0;i<(n);++i)
#define VAR(v,i) __typeof(i) v=(i)
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define SIZE(x) (int)x.size()
#define ALL(c) c.begin(),c.end()

#define ODD(x) ((x)%2)
#define EVEN(x) (!(ODD(x)))


class Primes {
    VI primes;
    VI is_prime;
public:
    Primes(int max_n) : is_prime(max_n+1, 1) {
        is_prime[0]=is_prime[1]=0;
        int p=2;
        int j=p*p;
        while (j<=max_n) {
            int k=j;
            while (k<=max_n) {
                is_prime[k]=0;
                k+=p;
            }
            p+=1;
            while (!is_prime[p]) {
                p+=1;
            }
            j=p*p;
        }
        REP(i, max_n+1) {
            if (is_prime[i]) {
                primes.PB(i);
            }
        }
    }

    bool is_big_prime(LL n) {
        if (n<2LL) return false;
        if (n<is_prime.size()) return is_prime[n];
        for (int p : primes) {
            if ((LL)p*p > n) break;
            if ((n % p) == 0) return false;
        }

        return true;
    }

    bool is_big_prime(const std::string &rep) {
        if (rep[0] == '0') return false;
        return is_big_prime(stoll(rep));
    }
};

int main() {
    ios_base::sync_with_stdio(0);
    string n;
    getline(cin, n);
    int max_prime_upper_bound = int(sqrt(stoll(n))) + 2;
    auto primes = Primes(max_prime_upper_bound);
    FOR(i, 1, n.size()-1) {
        if (primes.is_big_prime(n.substr(0, i)) && primes.is_big_prime(n.substr(i))) {
            cout << "TAK" << endl;
            return 0;
        }
    }
    cout << "NIE" << endl;
    return 0;
}