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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<char> toys1;
    int* letters1 = new int[26];
    int* letters2 = new int[26];
    for(int i = 0; i < 26; i++)
        letters1[i] = letters2[i] = 0;

    char toy;
   // int diff = 0;

    for(int i = 0; i < n; i++)
    {
        cin >> toy;
        toys1.push_back(toy);
        letters1[(int)toy - (int)'a'] += 1;
    }

    for(int i = 0; i < n; i++)
    {
        cin >> toy;
        letters2[(int)toy - (int)'a'] += 1;
        if(i % 2 == 0)
        {
            bool ok = false;
            for(int j = 0; j < n; j+=2)
            {
               
                if(toy == toys1.at(j))
                    { ok = true; break;}
                
            }
            if(!ok)
            {
                cout << "NIE";
                return 0;
            }
        }
        else
        {
            bool ok = false;
            for(int j = 1; j < n; j+=2)
            {
               
                if(toy == toys1.at(j))
                    { ok = true; break;}
                
            }
            if(!ok)
            {
                cout << "NIE";
                return 0;
            }
        }
        
    }
    

    for(int i = 0; i <26; i++)
        if(letters1[i] != letters2[i])
        {
            cout << "NIE";
            return 0;
        }
    cout << "TAK";   
    // if(diff % 2 == 0)
    //     cout << "TAK";
    // else
    //     cout << "NIE";
    

    return 0;
}