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
#include <iostream>
using namespace std;
typedef long long ll;

int sp(ll n)
{
    int w = 0;
    while(n > 0)
    {
        w++;
        n /= 10;
    }
    return w;
}

bool p(ll a)
{
    for(int i = 2; i * i <= a; i++)
    {
        if(a % i == 0)
            return 0;
    }
    return 1;
}

int main()
{
    ios_base::sync_with_stdio(0);
    ll n, i, j;

    cin>>n;
    int dl = sp(n);

    ll pom = 10;
    for(i = 0; i < dl - 1; i++)
    {
        ll b = n % pom;
        ll a = n / pom;
        pom *= 10;

        if(sp(b) == i + 1 and p(a) and p(b))
        {
            cout<<"TAK";
            return 0;
        }
    }

    cout<<"NIE";
}