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
#include <cstdio>

using namespace std;
using lint = long long;

bool isNotLetter(char c) {
    return c < 'a' || c > 'z';
}

struct hashes {
    const lint b;
    const lint mod;
    lint p;
    lint hash;
    lint rev_hash;
    
    void initHashes(lint c) {
        p = 1;
        hash = c % mod;
        rev_hash = c % mod;
    }

    bool cmpHashes() {
        return hash == rev_hash;
    }

    void updateHashes(lint c) {
        p = (p*b) % mod;
        hash = (b*hash + c) % mod;
        rev_hash = (rev_hash + p*c) % mod; 
    }
};

const int hashesCount = 3;
hashes H[hashesCount] = {
    {257, 1000000007},
    {983, 573261421},
    {593, 373588693},
};

void initHashes(lint c) {
    H[0].initHashes(c);
    H[1].initHashes(c);
    H[2].initHashes(c);
}

bool cmpHashes() {
    for(int i = 0; i < hashesCount; ++i) {
        if(!H[i].cmpHashes()) {
            return false;
        }
    }
    return true;
}

void updateHashes(lint c) {
    for(int i = 0; i < hashesCount; ++i) {
        H[i].updateHashes(c);
    }
}

int main() {
    scanf("%*d%*c");
    
    lint c = getchar();

    initHashes(c);

    do {
        c = getchar();
        
        if(isNotLetter(c)) {
            puts(cmpHashes() ? "TAK" : "NIE");
            break;
        }
        
        updateHashes(c);       
    } while(true);
     
    return 0;
}