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
#include <bits/stdc++.h>
 
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef pair<int,int> PI; 
typedef pair<LL,LL> PLL;
typedef unsigned long long ULL;
typedef pair<double,double> PD;
 
#define FOR(x, b, e) for(int x = b; x<= (e); x++)
#define FORD(x, b, e) for(int x = b; x>= (e); x--)
#define REP(x, n) for(int x = 0; x<(n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
 
#define PB push_back
#define IN insert
#define ST first
#define ND second
#define INF 2000000011
#define MOD 1000000007

#define MAXS

const LL minum=-1e13;

vector<LL> arr,res;

bool mozna(int len){

    vector<LL> sub(len);
    REP(i,len)
        sub[i]=arr[0];
    LL subSum=arr[0]*len;

    REP(i,len){
        LL prefSum=0;
        FOR(j,i,len-1){
            prefSum+=sub[j];
            if(prefSum>arr[j-i]){
                LL val=prefSum-arr[j-i];
                sub[j]-=val;
                prefSum-=val;
                subSum-=val;
            }
        }
    }

    if(subSum<arr[len-1])
        return false;

    LL val=subSum-arr[len-1];
    sub[len-1]-=val;

    for(auto x:sub)
        res.PB(x);   
    res.PB(minum);
    
    return true;
}

int main(){

    LL n;
    cin>>n;

    arr.resize(n);
    REP(i,n)
        cin>>arr[i];

    FOR(i,1,n){
        if(!mozna(i)){
            cout<<"NIE\n";
            return 0;
        }
    }

    cout<<"TAK\n"<<SIZE(res)<<"\n";
    for(auto x:res)
        cout<<x<<" ";
    cout<<"\n";

}