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
#include <bits/stdc++.h>
 
#define st first
#define nd second
#define pb push_back
#define BOOST ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
#define PI 3.14159265359
 
using namespace std;
 
typedef long long ll;
constexpr ll MOD = 1000000007, hot = 29;
constexpr ll FOX = 1234567891, cute = 1007;
constexpr ll MEGAN = 1000000009, liv = 107;
constexpr int MXN = 1000000+7 + 10, CZAPA = (1<<20), INF = 1000000000;

vector<pair<int, int> > V[2];

int main(){	
	BOOST;

    int n;
    string a, b;
    cin>> n >> a >> b;
    for(int i=0; i<n; i++){
        V[0].pb({int(a[i] - 'a'), i%2});
        V[1].pb({int(b[i] - 'a'), i%2});
    }
    sort(V[0].begin(), V[0].end());
    sort(V[1].begin(), V[1].end());
	bool ans = true;
    for(int i=0; i<n; i++){
        if(V[0][i].st != V[1][i].st || V[0][i].nd != V[1][i].nd)
            ans = false;
    }
    if(ans){
        cout<< "TAK\n";
    }
    else{
        cout<< "NIE\n";
    }
	return 0;
}