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
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
//mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
//int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=310;
int n,a[N];
ll s[N];
int main() {
	scanf("%d",&n);
	rep(i,1,n+1) scanf("%d",a+i);
	for (int i=1;i<=n;i++) for (int j=1;i+j<=n;j++) if (a[i]+a[j]<a[i+j]) {
		puts("NIE");
		return 0;
	}
	rep(i,1,n+1) s[i]=a[i];
	puts("TAK");
	printf("%d\n",n);
	rep(i,1,n+1) printf("%d%c",a[i]-a[i-1]," \n"[i==n]);
	rep(i,1,n+1) {
		ll x=-(1ll<<60);
		for (int j=0;j+i<=n;j++) x=max(x,s[j+i]-s[j]);
		assert(x==a[i]);
	}
}