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
#include <bits/stdc++.h>
using namespace std;
vector<int> a[26];
vector <int>b[26];
int n;
string s,t;

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

    cin>> n;
    cin>> s>> t;
    for (int i=0; i<n; i++)
    {
        a[s[i]-'a'].push_back(i&1);
        b[t[i]-'a'].push_back(i&1);
    }


    for (int i=0; i<26; i++)
    {
        sort (a[i].begin(), a[i].end());
        sort (b[i].begin(), b[i].end());
        if (a[i].size()!=b[i].size())
        {
            cout<< "NIE";
            return 0;
        }
    }

    for (int i=0; i<26; i++)
        for (int j=0; j<a[i].size(); j++)
            if (a[i][j]!=b[i][j])
            {
                cout<< "NIE";
                return 0;
            }
    cout<< "TAK";

    return 0;
}