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
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <set>
#include <map>
#include <utility>
#include <queue>
#include <vector>
#include <string>
#include <cstring>

#define REP(a,n) for (int a = 0; a<(n); ++a)
#define FOR(a,b,c) for (int a = (b); a<=(c); ++a)
#define FORD(a,b,c) for (int a = (b); a>=(c); --a)
#define FOREACH(a,v) for (auto a : v)

#define MP make_pair
#define PB push_back

template<class T> inline int size(const T&t) { return t.size(); }

using namespace std;

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<string> vs;
typedef long long LL;

///////////////////////////////

int N;
LL sumy[400], wyn[400], ogr[400];

int main() {
  cin >> N;
  REP(a, N)
    cin >> ogr[a + 1];
  FOR(a, 1, N) {
    LL najw = ogr[1];
    FOR(l, 1, a)
      najw = min(najw, ogr[a] - sumy[l - 1]);
    wyn[a - 1] = najw;
//    cerr << najw << "\n";
    FORD(l, a, 1)
      sumy[l] = sumy[l - 1] + najw;
    if (sumy[a] < ogr[a]) {
      //cerr << a << "\n";
      cout << "NIE\n";
      return 0;
    }
  }
  cout << "TAK\n" << N << endl;
  REP(a, N)
    cout << wyn[a] << (a == N - 1 ? '\n' : ' ');
}