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
#include <stdio.h>
#include <vector>
#include <map>
#include <unordered_set>
#include <queue>
#include <unordered_map>
#include <math.h>
#include <limits.h>
#include <algorithm>
#include <functional>
#include <iterator>
#include <algorithm>
#include <string>
#include <iostream>

using namespace std;

#define pb push_back
#define mp make_pair

typedef long long ll;
typedef unsigned long long ull;

using namespace std;

int sum[256][2];

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

  int n;
  cin >> n;

  string s1, s2;

  cin >> s1;
  cin >> s2;

  for (int i=0; i<s1.size(); ++i) {
    sum[s1[i]][i % 2] += 1;
  }
  for (int i=0; i<s2.size(); ++i) {
    sum[s2[i]][i % 2] -= 1;
  }

  bool okay = true;
  for (char c='a'; c <= 'z'; ++c) {
    if (sum[c][0] != 0 || sum[c][1] != 0){
      okay = false;
      break;
    }
  }

  if (okay) cout << "TAK" << endl;
  else cout << "NIE" << endl;



  return 0;
}