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
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
// Artur Kraska, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED)            ({typeof(P) X=P,RRR=(R), PPP = P; while(PPP<RRR) {X = (PPP+(RRR-PPP)/2); if(PRED) RRR = X; else PPP = X+1;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;

#define M 1000000007
#define INF 9999999999999LL

using namespace std;

int n;
long long tab[1007], gen[1007];

bool check()
{
    FOR(i, 1, n)
        FOR(j, 1, i-1)
            if(tab[j] + tab[i-j] < tab[i])
                return 0;
    return 1;
}

bool generuj()
{
    gen[1] = tab[1];
    FOR(i, 2, n)
    {
        gen[i] = tab[1];
        int s = 0;
        FORD(j, i-1, 1)
        {
            s += gen[j];
            gen[i] = min(gen[i], tab[i-j+1]-s);
        }
        if(s+gen[i] < tab[i])
            return 0;
    }
    return 1;
}

void testuj()
{
    srand(time(0));
    n = 20;
    forr(x, 100000)
    {
        FOR(i, 1, n)
        {
            tab[i] = 3+rand()%5;
        }
        int g = generuj();
        int c = check();
        //cout << x << ": " << g << " " << c << endl;
        if(g != c)
        {
            cout << n << endl;
            FOR(i, 1, n)
                cout << tab[i] << " ";
            cout << endl;
            break;
        }
    }
}

int main()
{
    //testuj();
    //return 0;

    scanf("%d", &n);
    FOR(i, 1, n)
        scanf("%lld", &tab[i]);

    generuj();
    //FOR(i, 1, n)
    //    cout << "gen[" << i << "] = " << gen[i] << endl;

    if(!check())
    {
        printf("NIE\n");
        return 0;
    }
    printf("TAK\n%d\n", n);
    FOR(i, 1, n)
        printf("%lld ", gen[i]);
    printf("\n");

    return 0;
}