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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int p1[26], p2[26];
int np1[26], np2[26];

int main() {
  ios_base::sync_with_stdio(false);

  int n;
  cin >> n;

  string s1, s2;
  cin >> s1 >> s2;

  for(int i = 0; i < n; i += 2) {
    p1[s1[i]-'a']++;
    p2[s2[i]-'a']++;
  }

  for(int i = 1; i < n; i += 2) {
    np1[s1[i]-'a']++;
    np2[s2[i]-'a']++;
  }
  bool ok = true;
  for(int i = 0; i < 26; ++i) {
    if(p1[i] != p2[i] || np1[i] != np2[i]) {
      ok = false;
    }
  }
  if(ok) {
    cout << "TAK\n";
  } else {
    cout << "NIE\n";
  }
}