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
103
104
105
106
107
108
109
110
111
112
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define PB push_back
#define ST first
#define ND second
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

const int K = 3;
const ull mod = 1e9 + 7;
ull primes[K] = {
	1e9 + 7,
	1e9 + 13,
	31,
};
struct Hash {
	ull prime, odw, mn, sum;
	Hash(){}
	Hash(ull prime_): prime(prime_), odw(0), mn(1), sum(0) {
	}
	void addChar(char c) {
		sum = sum + mn * (c - '0');
		mn = mn * prime;
		odw = odw * prime + (c - '0');
	}
	bool ok() {
		return sum == odw;
	}
} hashes[K];

const int M = 3;
ull smallPrimes[M] = {
	31,
	61,
	37,
};
struct HashMod {
	ull prime, odw, mn, sum;
	HashMod(){}
	HashMod(ull prime_): prime(prime_), odw(0), mn(1), sum(0) {
	}
	void addChar(char c) {
		sum = (sum + mn * (c - '0')) % mod;
		mn = (mn * prime) % mod;
		odw = (odw * prime + (c - '0')) % mod;
	}
	bool ok() {
		return sum == odw;
	}
} hashesMod[M];

int main() {
	int x;
	cin >> x;
	char c;
	c = getchar(); // read newline
	ull sum = 0, mn = 1;
	ull odw = 0;
	REP(i, K) hashes[i] = Hash(primes[i]);
	REP(i, M) hashesMod[i] = HashMod(smallPrimes[i]);
	while ((c = getchar()) != '\n') {
		REP(i, K) {
			hashes[i].addChar(c);
			hashesMod[i].addChar(c);
		}
	}
	REP(i, K) {
		if (!hashes[i].ok()) {
			printf("NIE\n");
			return 0;
		}
	}
	REP(i, M) {
		if (!hashesMod[i].ok()) {
			printf("NIE\n");
			return 0;
		}	
	}
	printf("TAK\n");
	return 0;
}