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
 96
 97
 98
 99
100
101
102
#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long int ull;

ull modularPow(ull base, ull exponent, ull modulus)
{
    if (modulus == 1)
        return 0;
    
    ull result = 1;
    base = base % modulus;
    
    while (exponent > 0)
    {
        if (exponent % 2 == 1)
            result = (result * base) % modulus;
        
        exponent >>= 1;
        base = (base * base) % modulus;
    }
    
    return result;
}

struct RollingHash
{
    ull hash;
    
    RollingHash()
    {
        hash = 0;
    }
    
    virtual void add(const ull n) = 0;
    
    protected:
        static const ull BASE = 101ULL;
        static const ull MODULUS = 654188383ULL;
};

struct LeftHash : RollingHash
{
    void add(const ull n) override
    {
        hash = (hash * BASE + n) % MODULUS;
    }
};

struct RightHash : RollingHash
{
    RightHash()
    {
        exponent = 0;
    }
    
    void add(const ull n) override
    {
        if (exponent == 0)
            hash = (hash + n) % MODULUS;
        else
        {
            ull addend = (n * modularPow(BASE, exponent, MODULUS)) % MODULUS;
            hash = (hash + addend) % MODULUS;
        }
        
        ++exponent;
    }
    
    private:
        ull exponent;
};

int main()
{
    ios_base::sync_with_stdio(false);

    unsigned int n;
    char c;
    LeftHash leftHash;
    RightHash rightHash;
    ull addend;
    
    cin >> n >> ws;
    while (cin.get(c))
    {
        if (!isalpha(c))
            break;
        
        addend = (ull) (c - 'a' + 1);
        leftHash.add(addend);
        rightHash.add(addend);
    }
    
    if (leftHash.hash == rightHash.hash)
        cout << "TAK\n";
    else
        cout << "NIE\n";

    return 0;
}