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
#include <bits/stdc++.h>
using namespace std;

void test_case() {
    int n;
    cin >> n;
    string a, b;
    cin >> a >> b;
    array<int, 26> odd_a{}, odd_b{}, even_a{}, even_b{};
    for (int i = 0; i < n; i++) {
        if (i % 2 == 0) {
            odd_a[a[i]-'a']++;
            odd_b[b[i]-'a']++;
        } else {
            even_a[a[i]-'a']++;
            even_b[b[i]-'a']++;
        }
    }
    bool yes = true;
    for (int i = 0; i < 26; i++) {
        if (odd_a[i] != odd_b[i])
            yes = false;
        if (even_a[i] != even_b[i])
            yes = false;
    }
    cout << (yes ? "TAK" : "NIE") << '\n';
}

void solve() {
    test_case();
}

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

    solve();

    return 0;
}