#include <iostream>
#include <unordered_map>

using namespace std;

int main() {
    unordered_map<string, int> howMany;
    char divs[] = {'A', 'B', 'C'};
    for (char division : divs) {
        for (int i = 1; i < 6; i++) {
            howMany[to_string(i) + division] = 0;
        }
    }
    int ideas;
    string zad;
    cin >> ideas;
    if(ideas > 100 || ideas < 1) { return 0; }
    for (int i = 0; i < ideas; i++) {
        cin >> zad;
        howMany[zad]++;
    }
    bool correctSet = true;
    for (const auto& key : howMany) {
        if (key.second == 0 || ((key.first == "5A" || key.first == "5B" || key.first == "5C") && key.second < 2)) {
            correctSet = false;
        }
    }
    correctSet ? cout << "TAK" : cout << "NIE";
    return 0;
}