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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
// Author: Piotr Grzegorczyk (ud2@interia.eu)
// Task: PA2018/PAL

#include <cstdio>

// TODO: algorytm dla n > 6400000

const int N = 5000000;
unsigned char buf[N/8][5] = {};
int buf_size = 0;

unsigned int powmod(unsigned int x, unsigned int e, unsigned int m) {
	unsigned int r = 1;
	unsigned int t = x;
	while (e) {
		if (e & 1) r = 1ull*r*t % m;
		t = 1ull*t*t % m;
		e >>= 1;
 	}
	return r;
}

int f(int j) {
	return powmod(6, 1 + j, 15485863);
}

void add_char(char c) {
	int i = buf_size / 8;
	int b = buf_size % 8;
	buf_size++;
	
	c -= 'a' - 1;

	for (int k=0; k<5; k++) {
		if (c & (1 << k))
			buf[i][k] |= (1 << b);
	}
}

char get_char(int p) {
	int i = p / 8;
	int b = p % 8;	

	char r = 0;
	for (int k=0; k<5; k++)
		if (buf[i][k] & (1 << b))
			r |= (1 << k);
	
	return r + 'a' - 1;
}

bool test(int n) {
	bool r = true;
	for (int i=0, j=n-1; i<j; i++, j--) 
		if (get_char(i) != get_char(j)) {
			r = false;
			break;
		}
	return r;
}

void calc(int & j, int & s, int i, int n) {
	if (n % 2 == 0) {
		if (i < n/2) {
			j = i;
			s = 1;
		} else {
			j = n-1-i;
			s = -1;
		}					
	} else {					
		if (i < n/2) {
			j = i;
			s = 1;					
		} else if (i==n/2){
			j = i;
			s = 0;					
		} else {
			j = n-1-i;
			s = -1;
		}
	}
}

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

	bool r = false;

	if (n > 0) {
	
		if (n/2 <= N) {			
			r = true;
			for (int i=0; i<n; i++) {
				char ch = getchar();
				
				int j, s;
				calc(j, s, i, n);
				
				if (s > 0) {
					add_char(ch);
				} else if (s < 0) {
					char ch2 = get_char(j);
					if (ch2 != ch) {
						r = false;
						break;
					}
				}
			}
			
		} else {
			
			long long S = 0;			
			for (int i=0; i<n; i++) {
				
				char ch = getchar();
				
				int j, s;
				calc(j, s, i, n);
				
				S += 1ll*ch*s*f(j);
			}
			
			r = (S == 0);
		}
	
	} else {
	
		n = 0;	
		while (true) {
			char ch = getchar();
			if (ch < 0 || ch < 'a' || ch > 'z')
				break;
			n++;	
			if (n <= N) 
				add_char(ch);
			else
				break; // :(
		}
	
		if (n <= N) 
			r = test(n);
	}

	puts(r ? "TAK" : "NIE");
 	
	return 0;
}