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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <array>
#include <random>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <climits>
#include <stack>
#include <random>
#include <bitset>
#include <numeric>
#include <cassert>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define rep(x, b, e) for(int x=(b); x<(e); ++x)
#define trav(a, x) for(auto& a : x)
#define ford(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define all(c) c.begin(),c.end()
#define sz(x) ((int)((x).size()))
#define pb push_back
#define st first
#define nd second
#define mp(x,y) make_pair(x,y)
typedef short int sint;

#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

const ll INF = 10000000000000LL;

void verify(const vector<int>& ogr, const vector<ll>& zb) {
	int n = sz(ogr) - 1;
	rep(dl, 1, n) {
		int curr = 0;
		rep(i, 0, dl - 1) {
			curr += zb[i];
		}
		rep(i, dl - 1, sz(zb)) {
			curr += zb[i];
			if (curr > ogr[dl]) {
				printf("NIE\n");
				exit(0);
				// return false;
			}
			curr -= zb[i -dl +1];
		}
	}
	// return true;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int n;
	scanf("%d", &n);
	vi a(n + 1);
	rep(i, 1, n + 1) scanf("%d", &a[i]);
	vector<ll> res, cur;
	res.pb(a[1]);
	cur.pb(a[1]);
	rep(dl, 2, n + 1) {
		if (a[dl] > dl * a[1]) {
			printf("NIE\n");
			return 0;
		}
		rep(podzial, 1, dl) {
			if (a[dl] > a[podzial] + a[dl - podzial]) {
				printf("NIE\n");
				return 0;
			}
		}
		int next = a[dl] - a[dl - 1];
		res.pb(-INF);
		cur.pb(next);
		// verify(a, cur);
		trav(x, cur) {
			res.pb(x);
		}
	}
	printf("TAK\n");
	printf("%d\n", sz(res));
	trav(x, res) printf("%lld ", x);
	printf("\n");
}