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
#include <bits/stdc++.h>
#define int long long
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const int MAX=305;
const int inf=1e18+9;
int a[MAX];
int dp[MAX];
int ans[MAX];
int pref[MAX];

int sum(int l,int r){
  return pref[r]-pref[l-1];
}
bool check(int n){
  for (int i=1;i<=n;i++)pref[i]=pref[i-1]+ans[i];
  for (int dlug=1;dlug<=n;dlug++){
    int mini=-inf;
    for (int i=1;i<=n-dlug+1;i++){
      int x=sum(i,i+dlug-1);
      mini=max(mini,x);
    }
    if (mini!=a[dlug]){
      return false;
    }
  }
  return true;
}
int32_t main(){
  BOOST;
  int n;
  cin>>n;
  for (int i=1;i<=n;i++)cin>>a[i];
  ans[1]=a[1];
  for (int i=2;i<=n;i++){
    ans[i]=a[i]-a[i-1];
  }
  /*
  for (int i=1;i<=n;i++){
    cout<<ans[i]<<" ";
  }
  cout<<"\n";
  */
  if (check(n)){
    cout<<"TAK\n";
    cout<<n<<"\n";
    for (int i=1;i<=n;i++)cout<<ans[i]<<" ";
  }
  else cout<<"NIE";
  return 0; 
}