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

using namespace std;

int main()
{
	long n, a[26]={0}, b[26]={0};
	char z;
	scanf("%ld", &n);
	for (long i = 0; i < n; ++i)
	{
		scanf(" %c", &z);
		if (i % 2 == 0)
			a[z - 'a']++;
		else
			b[z - 'a']++;
	}
	for (long i = 0; i < n; ++i)
	{
		scanf(" %c", &z);
		if (i % 2 == 0)
			a[z - 'a']--;
		else
			b[z - 'a']--;
	}
	for (long i = 0; i < 26; ++i)
	{
		if (a[i] != 0 || b[i] != 0)
		{
			printf("%s", "NIE");
			return 0;
		}
	}
	printf("%s", "TAK");
	return 0;
}