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
#include<bits/stdc++.h>
#define ST first
#define ND second
#define ll long long
#define ld long double
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using namespace std;

const ll  INF = 1e9 + 9;
const ll  MOD = 1e9 + 7;
const long long LINF = (ll)1e18 + 3;

// secik.insert({x, t++});
// secik.erase(secik.lower_bound({x,-1}));
// *secik.find_by_order(x)).first << "\n";
// secik.order_of_key(x)

//random_device device;
//mt19937 gener(device());
//uniform_int_distribution<ll > gen(0,n-1);
//gen(gener); // generate random number

int licz1[30][2],licz2[30][2];

int main(){
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	int n; cin >> n;
	string s1,s2; cin >> s1 >> s2;
	for(int i = 0; i < n; i++){
		licz1[s1[i]-'a'][i%2]++;
		licz2[s2[i]-'a'][i%2]++;
	}	
	bool ok = true;
	for(int i = 0; i < 30; i++) if(licz1[i][0] != licz2[i][0] || licz1[i][1] != licz2[i][1]) ok = false;
	
	if(ok) cout << "TAK\n";
	else cout << "NIE\n";
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	


	return 0;
}