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
#include <bits/stdc++.h>
using namespace std;
const int N_MAX = 3e5 + 123;

int n, j;

char x;

char bit1[N_MAX], baj1[N_MAX];

char bit2[N_MAX], baj2[N_MAX];

int main() {
	
	ios_base::sync_with_stdio(0);

	cin >> n;

	for (int i = 1; i <= n; ++i){
		cin >> x;
		if (i % 2 == 0){
			bit2[i] =  x ;
		}
		else {
			bit1[i] =  x ;
		}
	}
	for (int i = 1; i <= n; ++i){
		cin >> x;
		if (i % 2 == 0){
			baj2[i] = x ;
		}
		else {
			baj1[i] = x;
		}
	}

	sort(bit1 + 1, bit1 + 1 + n);
	sort(baj1 + 1, baj1 + 1 + n);
	sort(bit2 + 1, bit2 + 1 + n);
	sort(baj2 + 1, baj2 + 1 + n);

	if (n % 2 == 0){
		j = 1;
	}

	int koniec = n / 2;

	for (int i = n; i >= koniec; --i){
		if (baj1[i] != bit1[i]){
			cout << "NIE" << '\n';
			return 0;
		}
	}

	for (int i = n; i >= koniec; --i){
		if (baj2[i] != bit2[i]){
			cout << "NIE" << '\n';
			return 0;
		}
	}


	cout << "TAK" << '\n';


	return 0;
}