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
#include <iostream>
#include <map>
#include <unordered_map>
#include <vector>
#include <string>

using namespace std;

struct MapEntry
{
	int chars = 0;
	int evens = 0;
	int odds = 0;
};



int main()
{
	unsigned int N; // max 300, liczba najwiekszych wzrostow
	cin >> N;

	unordered_map<char, MapEntry> mapa;

	for (unsigned int i = 1; i <= N; ++i)
	{
		char c;
		cin >> c;

		mapa[c].chars++;

		if (i % 2 == 0)
		{

			mapa[c].evens++;
		}
		else
		{
			mapa[c].odds++;
		}
		
	}



	for (unsigned int i = 1; i <= N; ++i)
	{
		char c;
		cin >> c;

		mapa[c].chars--;

		if (i % 2 == 0)
		{

			mapa[c].evens--;
		}
		else
		{
			mapa[c].odds--;
		}
	}

	for (auto it : mapa)
	{
		if (it.second.chars != 0 || it.second.evens != 0 || it.second.odds != 0)
		{
			cout << "NIE";
			return 0;
		}
	}

	cout << "TAK";
	return 0;
}