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 <iostream>
#include <cstdio>

using namespace std;

const int M = 300003;
char a[M], b[M];
int L[26];

int main() {
    int n;
    
    scanf("%d",&n);
    scanf("%s",a);
    scanf("%s",b);
      
    for (int i = 0; i < n; i += 2) {
        L[a[i]-'a']++;
        L[b[i]-'a']--;
    }
    for (int i=0;i<26;i++)
        if (L[i]) {
            printf("NIE\n");
            return 0;
        }
    for (int i = 1; i < n; i += 2) {
        L[a[i]-'a']++;
        L[b[i]-'a']--;
    }
    for (int i=0;i<26;i++)
        if (L[i]) {
            printf("NIE\n");
            return 0;
        }
    printf("TAK\n");
    return 0;
 
}