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
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
const int INF = 0x3f3f3f3f;

#define FOR(i,b,e) for(int i = (b); i < (e); i++)
#define TRAV(x,a) for(auto &x: (a))
#define SZ(x) ((int)x.size())
#define PB push_back
#define X first
#define Y second

int cnt[26][2];

void solve(){
    int n;
    string s;
    cin >> n >> s;
    FOR(i, 0, SZ(s)) cnt[s[i]-'a'][i&1]++;
    cin >> s;
    FOR(i, 0, SZ(s)) cnt[s[i]-'a'][i&1]--;
    FOR(i, 0, 26) FOR(j, 0, 2) if(cnt[i][j]){
        cout << "NIE\n";
        return;
    }
    cout << "TAK\n";
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    solve();
    return 0;
}