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
#include<bits/stdc++.h>
using namespace std;
const int M_MAX=30;

int NP[M_MAX];
int P[M_MAX];

int main()
{
    int n;
    string S1,S2;
    cin>>n>>S1>>S2;
    
    for(int i=0;i<n;i++)
    {
        if((i+1)%2==1)
        {
            NP[S1[i]-'a']++;
            NP[S2[i]-'a']--;
        }
        else
        {
            P[S1[i]-'a']++;
            P[S2[i]-'a']--;
        }
    }

    for(int i=0;i<M_MAX;i++)
    {
        if(P[i]!=0 || NP[i]!=0)
        {
            cout<<"NIE";
            return 0;
        }
    }
    cout<<"TAK";
    return 0;
}