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
94
95
#include<cstdio>                                                                
#include<iostream>                                                              
#include<algorithm>                                                             
#include<string>                                                                
#include<vector>                                                                
#include<set>     
#include<cmath>                                                              
                                                                                
using namespace std;                                                            
                                                                                
typedef vector<int> VI;                                                         
typedef long long LL;                                                           
                                                                                
#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  

struct HashGen {
    LL prime, base;
    LL hash, revHash, factor;

    HashGen(LL prime, LL base): prime(prime), base(base) {
        factor = 1;
        hash = revHash = 0;
    }

    void addChar(char a) {
        hash = (hash + a * factor) % prime;
        factor = (factor * base) % prime;
        revHash = (revHash * base + a) % prime;
    }

    bool equalHashes() {
        return hash == revHash;
    }
};

struct Hashes {
    int size = 3;
    vector<HashGen> hashes;

    Hashes() {
        REP(i, size) {
            hashes.PB(HashGen(1000000007, rand() % 1000000006 + 1));
        }
    }

    void addChar(char a) {
        if(a < 'a' || a > 'z') return;
        REP(i, size) {
            hashes[i].addChar(a);
        }
    }

    bool areEquals() {
        REP(i, size) {
            if(!hashes[i].equalHashes()) return false;
        }
        return true;
    }
};
                                                                                
class Solver {                                                                  
    int n;                                                                      
    public:

    void readInput() {
        cin >> n;
        cin.get();
    }                                                             
                                                                                
    void solve() {
        char c;    
        Hashes hashes;    
        while(cin.get(c)) {
            hashes.addChar(c);
        }
        cout << (hashes.areEquals() ? "TAK\n" : "NIE\n");
    }                                                                           
};                                                                              
                                                                                
int main() {                                                                    
    ios_base::sync_with_stdio(0);                                               
    Solver solver;                                                              
    solver.readInput();                                                         
    solver.solve();                                                             
    return 0;                                                                   
}