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
#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 F[3][6];

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

  int n;
  cin >> n;
  int a[101];
  int num;
  string w;
  for (int i=0; i<n; ++i) {
    cin >> w;
    int y = w[0] - '0';
    int x = w[1] - 'A';
    //cout << "x: " << x << "y: " << y << "  :: " << w << endl;
    F[x][y] += 1;
  }

  int ans = 0;
  for (int i=0; i<3; ++i) {
    for (int j=1; j<=5; ++j) {
      if (F[i][j] > 0) ans += 1;
      if (j == 5 && F[i][j] > 1) ans += 1;
    }
  }
  if (ans == 18) cout << "TAK" << endl;
  else cout << "NIE" << endl;

  return 0;
}