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
#include<bits/stdc++.h>
#define ST first
#define ND second
#define ll long long
#define ld long double
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using namespace std;

const ll  INF = 1e9 + 9;
const ll  MOD = 1e9 + 7;
const long long LINF = (ll)1e18 + 3;

// secik.insert({x, t++});
// secik.erase(secik.lower_bound({x,-1}));
// *secik.find_by_order(x)).first << "\n";
// secik.order_of_key(x)

//random_device device;
//mt19937 gener(device());
//uniform_int_distribution<ll > gen(0,n-1);
//gen(gener); // generate random number

int main(){
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	int n; cin >> n;
	vector<ll> tab(n);
	for(int i = 0; i < n; i++) cin >> tab[i];
	vector<ll> res(n);
	res[0] = tab[0];
	ll sum = tab[0];
	for(int i = 1; i < n; i++){
		res[i] = tab[i] - sum;
		sum += res[i];
	}
	vector<ll> xd(n+1);
	bool ok = true;
	for(int i = 1; i <= n; i++){
		ll maks = -1e12;
		ll sumcia = 0;
		for(int j = 0; j < i; j++) sumcia += res[j];
		maks = max(maks,sumcia);
		for(int j = 0; j + i - 1 < n; j++){
			sumcia -= res[j];
			sumcia += res[j+i-1];
			maks = max(maks,sumcia);
		}
		if(maks != tab[i-1]) ok = false;
	}
	
	if(!ok){
		cout << "NIE\n";
	} else {
		cout << "TAK\n";
		cout << n << "\n";
		for(auto it : res) cout << it << " ";
	}
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	


	return 0;
}