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
#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef pair<ll, int> PILL;
typedef pair<ll, ll> PLL;

const int MAX_N = 1e5+5;
const int M = 1e6;
const ll INF = (ll)(1e12);
const int inf = 2e9;
const ll MOD = 1000000007LL;

int n;
ll a[305];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
	
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	
	vector<ll> ans;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= i; j++) {
			if (a[j] - a[j-1] > a[1]) {
				cout << "NIE\n";
				return 0;
			}
			ans.push_back(a[j] - a[j-1]);
		}
		ans.push_back(-INF);
	}
	
	cout << "TAK\n";
	cout << (int)ans.size() << '\n';
	for (ll i: ans) {
		cout << i << ' ';
	}
	cout << '\n';
	
    return 0;
}