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

string a, b, a_odd, a_even, b_odd, b_even;

int main() {
  int n;

  cin >> n >> a >> b;

  for (int i = 0; i < n; i += 2) a_odd.push_back(a[i]);
  for (int i = 1; i < n; i += 2) a_even.push_back(a[i]);
  for (int i = 0; i < n; i += 2) b_odd.push_back(b[i]);
  for (int i = 1; i < n; i += 2) b_even.push_back(b[i]);

  sort(a_odd.begin(), a_odd.end());
  sort(a_even.begin(), a_even.end());
  sort(b_odd.begin(), b_odd.end());
  sort(b_even.begin(), b_even.end());

  if ((a_odd == b_odd) && (a_even == b_even)) {
    cout << "TAK\n";
    return 0;
  }

  cout << "NIE\n";
  return 0;
}