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
//Marcin Knapik

// Potyczki algorytmiczne 2020 - runda druga C

#include<bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define pb push_back
#define vi vector<int>

#define ld long long
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vii vector<ii>
#define vvi vector<vi>
int n;

multiset<pair<char, int> > zrob(string s){
    multiset<pair<char, int> > ret;
    for(int i = 0; i < sz(s); i++)
        ret.insert({s[i], i & 1});
    return ret;
}

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

    string s, t;
    cin >> n >> s >> t;

    multiset<pair<char, int> > A = zrob(s), B = zrob(t);
    cout << (A == B ? "TAK" : "NIE") << '\n';
}