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
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
//#pragma comment(linker, "/stack:200000000")
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define var(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define un(x) x.erase(unique(ALL(x)),x.end())
#define REP(i,x,v)for(int i=x;i<=v;i++)
#define REPD(i,x,v)for(int i=x;i>=v;i--)
#define FOR(i,v)for(int i=0;i<v;i++)
#define TRAV(i,v)for(auto &i:(v))
#define REMIN(x,v) x=min(x,v);
#define REMAX(x,v) x=max(x,v);

mt19937_64 rng(134569);
int rd(int l, int r) {return uniform_int_distribution<int>(l, r)(rng);}

using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
const int MOD=1e9+7;//998244353;

ll a[1000];
ll s[1000];
// int cntVerif=0;

// void verif(vector<ll> & res) {
//   cntVerif++;
//   int n=SZ(res);
//   s[0]=0;
//   FOR(i,n) s[i+1]=res[i]+s[i];
//   REP(d,1,n) {
//     ll mx = -(1<<20);
//     FOR(i,n) {
//       if (i+d>n) break;
//       ll g = s[i+d]-s[i];
//       REMAX(mx,g);
//     }
//     assert(mx==a[d]);
//   }
// }


bool solve(vector<ll> v, vector<ll> & res) {
  int n=SZ(v);
  FOR(i,n) a[i+1]=v[i];
  bool bad=0;
  REP(d,1,n) {
    REP(j,1,d-1) {
      if (a[j]+a[d-j]<a[d]) {
        //debug()<<var(j)<<var(d)<<var(a[j])<<var(a[d]);
        bad=1;
      }
    }
  }
  if (bad) return 0;
  res.clear();
  ll sum=0;
  REP(i,1,n) {
    res.pb(a[i]-sum);
    sum=a[i];
  }
  //verif(res);
  return 1;
}


// int main()
// {
//   ios_base::sync_with_stdio(0);cin.tie(0);
//   REP(n,1,10) {
//     debug()<<var(n);
//     cntVerif=0;
//     while(cntVerif<500000) {
//       vector<ll> v, res;
//       FOR(i,n) v.pb(rd(-5,5));
//       solve(v,res);
//     }
//   }
// }


int main()
{
	ios_base::sync_with_stdio(0);cin.tie(0);
	cout << fixed << setprecision(11);
	cerr << fixed << setprecision(6);
  int n;cin>>n;
  vector<ll>v(n);
  REP(i,1,n) cin>>v[i-1];
  vector<ll> res;
  bool ok=solve(v, res);
  if (!ok) {
    cout<<"NIE\n";
  } else {
    cout<<"TAK\n";
    cout<<SZ(res)<<"\n";
    FOR(i, SZ(res)) {
      cout<<res[i]<<" ";
    }
    cout<<"\n";
  }
  return 0;
}