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
#include <cstdio>
#include <cstdlib>
#include <algorithm>

using namespace std;

const int Z_MAX = 26;

int A[2][Z_MAX];
int B[2][Z_MAX];

int main() {
	int n;
	scanf("%d", &n);
	getchar();
	for (int i = 1; i <= n; ++i) {
		int c = getchar() - 'a';
		A[i % 2][c]++;
	}
	getchar();
	for (int i = 1; i <= n; ++i) {
		int c = getchar() - 'a';
		B[i % 2][c]++;
	}
	getchar();
	for (int i = 0; i < Z_MAX; ++i) {
		if (A[0][i] != B[0][i] || A[1][i] != B[1][i]) {
			printf("NIE\n");
			return 0;
		}
	}
	printf("TAK\n");
	return 0;
}