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
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
#define REPD(i,a,b) for (int i = (a); i >= (b); --i)
#define FORI(i,n) REP(i,1,n)
#define FOR(i,n) REP(i,0,int(n)-1)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define ll long long
#define SZ(x) int((x).size())
#define DBG(v) cerr << #v << " = " << (v) << endl;
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define fi first
#define se second

int a[333];

int main() {
	int n;
	scanf("%d", &n);
	FORI(i,n) scanf("%d", &a[i]);
	FORI(i,n) FORI(j,n) if (i+j<=n) if (a[i]+a[j] < a[i+j]) {
		printf("NIE\n");
		return 0;
	}
	printf("TAK\n%d\n", n);
	FORI(i,n) printf("%d ", a[i]-a[i-1]);
	printf("\n");
	return 0;
}