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
#include <vector>
#include <string>
#include <iostream>
#include <unordered_map>
#include <algorithm>

using namespace std; 

int main()
{
    std::iostream::sync_with_stdio(false);
    
    int n;
    std::cin >> n;

    int amountOfToys = n;
    
    vector<char> vect1;
    vector<char> vect2;
    vector<char> vect3;
    vector<char> vect4;
    
    while (n--)
    {
        if (n%2 == 0)
        {
            char sign;
            cin >> sign;
            vect1.push_back(sign);
        }
        else 
        {
            char sign;
            cin >> sign;
            vect2.push_back(sign);
        }
    }
    
    while (amountOfToys--)
    {
        if (amountOfToys%2 == 0)
        {
            char sign;
            cin >> sign;
            vect3.push_back(sign);
        }
        else 
        {
            char sign;
            cin >> sign;
            vect4.push_back(sign);
        }
    }
    
    sort(vect1.begin(), vect1.end());
    sort(vect2.begin(), vect2.end());
    sort(vect3.begin(), vect3.end());
    sort(vect4.begin(), vect4.end());
    
    for(std::vector<int>::size_type i = 0; i != vect1.size(); i++) {
        if (vect1[i] != vect3[i]){
            cout << "NIE";
            return 0;
        }
    }

    for(std::vector<int>::size_type i = 0; i != vect2.size(); i++) {
        if (vect2[i] != vect4[i]){
            cout << "NIE";
            return 0;
        }
    }
    
    cout << "TAK";
    
    return 0;
}