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

using LL = long long int;

bool check(std::vector<int> const& ranks)
{
    if (ranks.size() == 1)
        return true;
    
    for (int i = 1; i<ranks.size(); ++i)
    {
        for (int j=0;j<i;++j)
        {
            if (ranks[i]-ranks[j]>ranks[i-j-1])
                return false;
        }
    }

    return true;
}

void solve(std::vector<int> const& ranks)
{
    std::cout << ranks.front();
    for(int i = 1; i<ranks.size(); ++i)
    {
        std::cout << " " << (ranks[i] - ranks[i-1]);
    }

    std::cout << std::endl;
}

int main()
{
    int n;
    std::cin >> n;
    std::vector<int> ranks;
    for(int i = 0; i<n; ++i)
    {
        int tmp;
        std::cin >> tmp;
        ranks.push_back(tmp);
    }
    if (!check(ranks))
    {
        std::cout << "NIE" << std::endl;
        return 0;
    }
    std::cout << "TAK" << std::endl;
    solve(ranks);

    return 0;
}