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

using namespace std;

int main () {
    int n;
    cin >> n;

    unordered_map<char, int> count;

    char a[n], b[n];
    for (int i = 0 ; i < n ; ++ i) {
        char c;
        cin >> c;
        a[i] = c;
        count[c] ++;
    }
    for (int i = 0 ; i < n ; ++ i) {
        char c;
        cin >> c;
        b[i] = c;
        count[c]--;
    }

    for (auto &p : count) {
        if (p.second != 0) {
            cout << "NIE" << endl;
            return 0;
        }
    }

    if ((n == 2) && (a[0] != b[0]) && (a[1] != b[1])) {
        cout << "NIE" << endl;
        return 0;
    }
    cout << "TAK" << endl;
    return 0;
}