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
#include <bits/stdc++.h>
using namespace std;
#define bit(n, i) ((n>>i) & 1)
#define fi first
#define se second
#define pb push_back
#define cat(x) cerr << #x " = " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ld = long double;

const ll inf = 1e18;

const int N = 309;
ll A[N], B[N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n; cin >> n;
    for(int i = 1; i <= n; ++i) {
        cin >> A[i];
    }
    bool ok = true;
    for(int i = 2; i <= n; ++i) {
        ll mn = A[i];
        for(int j = 1; 2*j <= i; ++j)
            mn = min(mn, A[j]+A[i-j]);
        if(mn < A[i]) {
            ok = false;
            break;
        }
    }
    if(ok) {
        cout << "TAK\n" << (ll)n*((ll)(n+1))/2+(ll)n << "\n";
        for(int i = 1; i <= n; ++i) {
            B[i] = A[i]-A[i-1];
            for(int j = 1; j <= i; ++j)
                cout << B[j] << " ";
            cout << (ll)(-1e13+9) << " ";
        }
    }
    else cout << "NIE";

    return 0;
}