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
#include <iostream>

using namespace std;

const int N = 1 << 8;

int n;
int Cnt[2][2][N];

void init() {
    cin >> n;
    
    for (int i=0; i<2; i++) {
        for (int j=0; j<n; j++) {
            char letter;
            cin >> letter;
            
            Cnt[i][j&1][letter]++;
        }
    }
}

void solve() {
    bool possible = 1;
    
    for (int i='a'; i<='z'; i++) {
        if (Cnt[0][0][i] != Cnt[1][0][i] || Cnt[0][1][i] != Cnt[1][1][i]) {
            possible = 0;
            break;
        }
    } 
    
    if (possible == 0) {
        cout << "NIE\n";
    } else {
        cout << "TAK\n";
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    init();
    solve();
    
    return 0;
}