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 <iostream>
#include <string>
#include <map>
#include <algorithm>

int main()
{
    std::map<std::string,short> tasks =
      {{"1A", 1}, {"1B", 1}, {"1C", 1},
       {"2A", 1}, {"2B", 1}, {"2C", 1},
       {"3A", 1}, {"3B", 1}, {"3C", 1},
       {"4A", 1}, {"4B", 1}, {"4C", 1},
       {"5A", 2}, {"5B", 2}, {"5C", 2}};
    int N;
    std::cin>>N;
    for(int i=0; i<N;++i)
    {
        std::string s;
        std::cin>>s;
        --tasks[s];
    }
    auto allTasks = std::all_of(tasks.begin(), tasks.end(),
        [](const auto& p){ return p.second <= 0;});
    allTasks
        ? std::cout << "TAK"<<std::endl
        : std::cout <<"NIE"<<std::endl;
    return 0;
}