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
63
64
65
66
67
68
69
#include <bits/stdc++.h>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
#define FOR(x, b, e) for(int x = b; x<= (e); ++x)
#define FORD(x, b, e) for(int x = b; x>= (e); --x)
#define REP(x, n) for(int x = 0; x<(n); ++x)
#define VAR(v, n)typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB pushback
#define ST first
#define ND second

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

    int n;
    cin >> n;

    char a[n], b[n];
    int Ap[26], Anp[26], Bp[26], Bnp[26];
    FOR(i, 0, 25) {
        Ap[i] = 0;
        Anp[i] = 0;
        Bp[i] = 0;
        Bnp[i] = 0;
    }
    FOR(i, 0, n - 1) {
        cin >> a[i];
        if (i % 2 == 0) {
            Ap[a[i] - 97]++;
        }
        else {
            Anp[a[i] - 97]++;
        }
    }
    FOR(i, 0, n - 1) {
        cin >> b[i];
        if (i % 2 == 0) {
            Bp[b[i] - 97]++;
        }
        else {
            Bnp[b[i] - 97]++;
        }
    }

    bool result = 1;

    FOR(i, 0, 25) {
        if (Ap[i] != Bp[i] || Anp[i] != Bnp[i]) {
            result = 0;
        }
    }

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

    return 0;
}