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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <iostream>

using namespace std;

int main()
{
    int n;
    cin >> n;
    
    int bitus_np[26];
    int bitus_p[26];
    
    for(int i = 0; i < 26; i++){
        bitus_np[i] = 0;
        bitus_p[i] = 0;
    }
    
    char a;
    int b;
    
    for(int i = 0; i < n/2; i++){
        cin >> a;
        b = a - 'a';
        bitus_np[b]++;
        
        cin >> a;
        b = a - 'a';
        bitus_p[b]++;
    }
    
    if(n%2 == 1){
        cin >> a;
        b = a - 'a';
        bitus_np[b]++;
    }
    
    for(int i = 0; i < n/2; i++){
        cin >> a;
        b = a - 'a';
        bitus_np[b]--;
        
        cin >> a;
        b = a - 'a';
        bitus_p[b]--;
    }
    
    if(n%2 == 1){
        cin >> a;
        b = a - 'a';
        bitus_np[b]--;
    }
    
    bool czy = true;
    
    for(int i = 0; i < 26; i++){
        if(bitus_p[i] != 0 || bitus_np[i] != 0)
            czy = false;
    }
    
    if(czy)
        cout << "TAK";
    else
        cout << "NIE";
    
    return 0;
}