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
// Artur Kraska, II UWr

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <cmath>
#include <list>
#include <set>
#include <map>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(typeof(coll.begin()) iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(typeof(coll.rbegin()) iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED)            ({typeof(P) X=P,RRR=(R), PPP = P; while(PPP<RRR) {X = (PPP+(RRR-PPP)/2); if(PRED) RRR = X; else PPP = X+1;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000007

#define P1 2100001103
#define P2 2100001069
#define P3 2100001097
#define X1 1000001053
#define X2 1000001087
#define X3 1000001099

using namespace std;

int n, m, a;
char c;
long long ILE = 3, lewo[10], prawo[10], dz[10];
long long P[] = {2100001103, 2100001069, 2100001097}, X[] = {1000001053, 1000001087, 1000001099};

int main()
{
    forr(i, ILE+1)
        dz[i] = 1;

    scanf("%d", &n);

    while(c < 'a' || c > 'z')
        c = getchar();

    while(c >= 'a' && c <= 'z')
    {
        forr(i, ILE)
        {
            lewo[i] = (lewo[i] * X[i] + c) % P[i];
            prawo[i] = (prawo[i] + dz[i]*c) % P[i];
            dz[i] = dz[i]*X[i] % P[i];
//            cout << (int)c << " ->" << lewo[i] << " - " << prawo[i] << endl;
        }
        lewo[ILE] = lewo[ILE]*789+c;
        prawo[ILE] += dz[ILE] * c;
        dz[ILE] *= 789;
//        cout << (int)c << " ->" << lewo[ILE] << " - " << prawo[ILE] << endl;
        c = getchar();
    }

    forr(i, ILE+1)
        if(lewo[i] != prawo[i])
        {
            printf("NIE\n");
            return 0;
        }
    printf("TAK\n");

    return 0;
}