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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstring>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

#define FOR(x, b, e) for (int x = b; x <= (e); ++x)
#define FORD(x, b, e) for (int x = b; x >= (e); --x)
#define REP(x, n) for (int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int) (x).size())
#define FOREACH(i, c) for (VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define MP make_pair
#define EB emplace_back

#define INF 1000000001

bool IsPrime(const char* buf, int len) {
    char tmp[16];
    memcpy(tmp, buf, len);
    tmp[len] = '\0';

    int d;
    sscanf(tmp, "%d", &d);

    if (d < 2) return false;

    for (int i = 2, i2 = 4; i2 <= d; i2 += 2 * i + 1, ++i) {
        if (d % i == 0) return false;
    }

    return true;
}

bool Druga(const char* buf)
{
    int l = strlen(buf);
    for (int i = 1; i < l; ++i) if (buf[i] != '0') {
        if (IsPrime(buf, i) && IsPrime(buf + i, l - i)) return true;
    }

    return false;
}


int main()
{
    //ios_base::sync_with_stdio(0);
    char buf[16];
    scanf(" %s ", buf);
    printf(Druga(buf) ? "TAK\n" : "NIE\n");

    return 0;
}