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
#include <iostream>
#include <string>
#include <algorithm>


using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin>>n;
    string a,b;
    cin>>a>>b;
    string ap="",anp="",bp="",bnp="";
    for(int i=0;i<n;i++)
    {
        if(i%2==0)
        {
            ap+=a[i];
            bp+=b[i];
        }
        else
        {
            anp+=a[i];
            bnp+=b[i];
        }
    }
    sort(ap.begin(),ap.end());
    sort(anp.begin(),anp.end());
    sort(bp.begin(),bp.end());
    sort(bnp.begin(),bnp.end());
    if(ap!=bp)
    {
        cout<<"NIE"<<endl;
        return 0;
    }
    if(anp!=bnp)
    {
        cout<<"NIE"<<endl;
        return 0;
    }
    cout<<"TAK"<<endl;
}