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
113
114
115
116
117
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <bitset>

using namespace std;

typedef unsigned long long LL;

#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(val) ((val) < 0 ? -(val) : (val))

#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

#define M 1000000007ULL

/* PA2018 PAL */
/* Brute! */

#define LIMIT  (1024 * 1024 * 25 / 10)

char al [LIMIT];

int main() {

	int n;
	scanf("%d\n", &n);

	bool guess = false;
	if (n == 0)
	{
		guess = true;
		n = 2 * LIMIT - 5;
	}

	if (n > 2 * LIMIT - 5)
	{
		printf("NIE");
		return 0;
	}

	REP (i, n / 2)
	{
		char c = getchar();
		if (guess)
		{
			if ((c < 'a') || (c > 'z'))
			{
				bool success = true;
		
				REP (k, i)
				{
	//				printf ("k: %d, r: %d, a[k] = %c, a[r] = %c\n", k, i - k - 1, al[k], al[i - k - 1]);
					if (al[i - k - 1] != al[k])
					{
						success = false;
					}
				}
				if (success)
					printf("TAK");
				else
					printf("NIE");
				return 0;
			}
		}

		al[i] = c;	
	}
		
	if (guess)
	{
		printf("NIE");
		return 0;
	}
		
	if (n % 2)
	{
		getchar();
	}
	
	bool success = true;
	REP (i, n / 2)
	{
		char c = getchar();
		if (al[n / 2 - i - 1] != c)
		{
			success = false;
			break;
		}
	}

	if (success)
		printf("TAK");
	else
		printf("NIE");
	
	


	return 0;
}