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
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#ifdef LOC
#include "debuglib.h"
#else
#define deb(...)
#define DBP(...)
#endif
using namespace std;
using   ll         = long long;
using   Vi         = vector<int>;
using   Pii        = pair<int, int>;
#define pb           push_back
#define mp           make_pair
#define x            first
#define y            second
#define rep(i, b, e) for (int i = (b); i < (e); i++)
#define each(a, x)   for (auto& a : (x))
#define all(x)       (x).begin(), (x).end()
#define sz(x)        int((x).size())

int n;
vector<ll> diff;

vector<ll> getSegment(int k) {
	vector<ll> ret(k);

	rep(t, 0, 2) {
		rep(i, 0, k) {
			rep(d, 1, k-i) {
				ret[i+d] = min(ret[i+d], ret[i] + diff[d-1]);
			}
		}
		ret[0] = min(ret[0], ret[k-1] - diff[k-2]);
	}

	rep(i, 0, k) {
		rep(d, 1, k-i) {
			if (ret[i] + diff[d-1] < ret[i+d]) {
				cout << "NIE" << endl;
				exit(0);
			}
		}
	}

	rep(i, 1, k) ret[i] -= ret[0];
	ret[0] = 0;
	return ret;
}

int main() {
	cin.sync_with_stdio(0); cin.tie(0);
	cout << fixed << setprecision(10);

	cin >> n;
	diff.resize(n);
	each(k, diff) cin >> k;

	vector<ll> ans;

	rep(d, 2, n+2) {
		for (ll x : getSegment(d)) {
			ans.pb(x - ll(2e9) * d);
		}
	}

	cout << "TAK\n";
	cout << sz(ans)-1 << '\n';
	rep(i, 1, sz(ans)) {
		cout << ans[i] - ans[i-1] << ' ';
	}
	cout << '\n';
	return 0;
}