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
#include <bits/stdc++.h>
using namespace std;

map <char, pair < int , int > > M;

string s,s2;

int n;


/// first -> parzyste                                       second -> nieparzyste

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> s >> s2;

    string s3 = s;
    string s4 = s2;

    sort(s3.begin(),s3.end());
    sort(s4.begin(),s4.end());

    if(s3 != s4)
    {
        cout << "NIE" << endl;
        return 0;
    }


    for(int i = 0; i < n; i++)
    {
        if(i % 2 == 0)
            M[ s[i] ].first++;
        else
            M[ s[i] ].second++;
    }

    for(int i = 0; i < n; i++)
    {
        if(i % 2 == 0)
        {
            M[ s2[i] ].first--;

            if(M[ s2[i] ].first < 0)
            {
                cout << "NIE" << endl;
                return 0;
            }
        }
        else
        {
            M[ s2[i] ].second--;

            if(M[ s2[i] ].second < 0)
            {
                cout << "NIE" << endl;
                return 0;
            }
        }
    }

    for(int i = 0; i < n; i++)
    {
        if( M[ s[i] ].first != 0 || M[ s[i] ].second != 0)
        {
            cout << "NIE" << endl;
            return 0;
        }
    }

    cout << "TAK" << endl;

}