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

using namespace std;

int n;
int a[400];
int b_size;
int b[100005];

bool check(){
	for (int i = 1; i <= n; ++i)
	{
		long long m = -9999999999999;
		for(int j = 0; j + i < b_size; j++){
			long long cur = 0;
			for (int t = j; t < i + j; ++t)
			{
				cur += b[t];
			}
			m = max(m ,cur);
		}
		if(a[i] != m){
			cout << i << endl;
			return false;
		}
	}

	return true;

}

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

	cin >> n;
	for (int i = 1; i <= n; ++i)
	{
		cin >> a[i];
	}
	for (int i = 1; i <= n; ++i)
	{
		for (int j = 1; j <= n; ++j)
		{
			if(i + j <= n){
				if(a[i] + a[j] < a[i + j]){
					//return 0;
					cout << "NIE" << endl;
					return 0;
				}
			}
		}
	}

	//a[0] = 0;
	for (int i = 0; i < n; ++i)
	{
		b[i] = a[i + 1] - a[i];
	}
	b_size = n;

	/*if(!check()){
		cout << "ERROR!" << endl;
	}*/

	cout << "TAK" << endl;
	cout << b_size << endl;
	for (int i = 0; i < b_size; ++i)
	{
		cout << b[i] << " ";
	}
	cout << endl;
}