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

using namespace std;

int main()
{
    int n;
    cin>>n;
    vector<char>a1;
    vector<char>b1;
    vector<char>a2;
    vector<char>b2;
    string s1,s2;
    cin>>s1>>s2;
    for(int i=0; i<n; i++)
    {
        if(i%2==1)
            a1.push_back(s1[i]);
        else
            a2.push_back(s1[i]);
    }
    for(int i=0; i<n; i++)
    {
        if(i%2==1)
            b1.push_back(s2[i]);
        else
            b2.push_back(s2[i]);
    }
    sort(a1.begin(),a1.end());
    sort(a2.begin(),a2.end());
    sort(b1.begin(),b1.end());
    sort(b2.begin(),b2.end());
    if(a1==b1&&a2==b2)cout<<"TAK";
    else cout<<"NIE";

    return 0;
}