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
#include <stdio.h>

const int max = 3e5 + 10;

int main()
{
    int n;
    char bitus[max];
    char bajtus[max];
    int  bit[26][2] = {};
    int  bajt[26][2] = {};
    
    scanf("%d%s%s", &n, bitus, bajtus);
    
    for (int i = 0; i < n; i++)
    {
        bit[bitus[i] - 'a'][i % 2]++;
        bajt[bajtus[i] - 'a'][i % 2]++;
    }
    
    for (int i = 0; i < 26; i++)
        for (int j = 0; j < 2; j++)
            if (bit[i][j] != bajt[i][j])
            {
                printf("NIE\n");
                return 0;
            }

    printf("TAK\n");
    
    return 0;
}