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
60
61
62
#include <iostream>
#include <set>
#include <vector>
#include <utility>
#include <map>
#include <queue>
#include <algorithm>
#include <string>
#include <map>
using namespace std;
#define PB push_back
#define MP make_pair
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;

int n;
vector<vector<int>> a, b;

void solve() {
    cin >> n;
    a.resize(26, { 0, 0 });
    b.resize(26, { 0, 0 });

    string s;
    cin >> s;

    for (int i = 0; i < n; i++) {
        a[(int)(s[i] - 'a')][i % 2]++;
    }

    cin >> s;
    for (int i = 0; i < n; i++) {
        b[(int)(s[i] - 'a')][i % 2]++;
    }

    bool can = true;
    for (int i = 0; i < 26; i++) {
        if (a[i] != b[i]) {
            can = false;
        }
    }

    if (can) {
        cout << "TAK\n";
    }
    else {
        cout << "NIE\n";
    }
}

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

    solve();

    return 0;
}