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
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back

using namespace std;
typedef long long ll;

const int MAXN = 1000*1000 + 7;
const int INF = 1000*1000*1000 + 7;

int ile1[30][2];
int ile2[30][2];

int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0);

	int n;
	string S1, S2;
	cin >> n;
	cin >> S1;
	cin >> S2;

	for(int i = 0; i < n; i++)
		ile1[S1[i] - 'a'][i%2]++, ile2[S2[i] - 'a'][i%2]++;
	bool wyn = true;
	for(int i = 0; i <= 26; i++)
	{
		if(ile1[i][0] != ile2[i][0] || ile1[i][1] != ile2[i][1])
		{
			wyn = false;
			break;
		}
	}
	cout << (wyn ? "TAK" : "NIE") << '\n';
	return 0;
}