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
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
const int INF = 0x3f3f3f3f;

#define FOR(i,b,e) for(int i = (b); i < (e); i++)
#define TRAV(x,a) for(auto &x: (a))
#define SZ(x) ((int)x.size())
#define PB push_back
#define X first
#define Y second

const int N = 305;

int t[N], el[N], maks[N];

void solve(){
    int n;
    cin >> n;
    FOR(i, 0, n) cin >> t[i];
    FOR(i, 0, n) el[i] = t[i] - (i > 0 ? t[i-1] : 0);
    memset(maks, -INF, sizeof(maks));
    FOR(i, 0, n){
        int sum = 0;
        FOR(j, i, n){
            sum += el[j];
            maks[j-i] = max(maks[j-i], sum);
        }
    }
    FOR(i, 0, n) if(t[i] != maks[i]){
        cout << "NIE\n";
        return;
    }
    cout << "TAK\n";
    cout << n << '\n';
    FOR(i, 0, n) cout << el[i] << ' ';
    cout << '\n';
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    solve();
    return 0;
}