#include <cstdio>
#include <cctype>
#include <algorithm>
#define N 500010
using namespace std;
struct data
{int d , p;data() {}data(int D , int P) {d = D , p = P;}bool operator<(const data &a)const {return d < a.d;}
}v[N];
int a[N] , b[N] , l[N] , tot , x[N] , y[N] , z[N] , cnt;
int main()
{int n , i , t , len = 1 << 30 , val;scanf("%d" , &n);if(n == 2){puts("TAK\n1 2 1");return 0;}for(i = 2 ; i < n ; i ++ ) scanf("%d" , &a[i]);for(i = 2 ; i < n ; i ++ ) scanf("%d" , &b[i]) , l[i] = a[i] + b[i] , len = min(len , l[i]);if(a[2] != b[2]){val = max(a[2] - b[2] , b[2] - a[2]);for(i = 3 ; i < n ; i ++ )if(a[i] - b[i] != val && b[i] - a[i] != val)break;if(i == n){printf("TAK\n1 %d %d\n" , n , val);for(i = 2 ; i < n ; i ++ ){if(a[i] < b[i]) printf("1 %d %d\n" , i , a[i]);else printf("%d %d %d\n" , n , i , b[i]);}return 0;}}v[++tot] = data(0 , 1);for(i = 2 ; i < n ; i ++ )if(l[i] == len)v[++tot] = data(a[i] , i);v[++tot] = data(len , n);sort(v + 1 , v + tot + 1);for(i = 1 ; i < tot ; i ++ ){if(v[i].d == v[i + 1].d){puts("NIE");return 0;}x[++cnt] = v[i].p , y[cnt] = v[i + 1].p , z[cnt] = v[i + 1].d - v[i].d;}for(i = 2 ; i < n ; i ++ ){if(l[i] != len){if((l[i] - len) & 1 || (t = lower_bound(v + 1 , v + tot + 1 , data(a[i] - ((l[i] - len) >> 1) , 0)) - v) > tot || v[t].d != a[i] - ((l[i] - len) >> 1)){puts("NIE");return 0;}x[++cnt] = v[t].p , y[cnt] = i , z[cnt] = (l[i] - len) >> 1;}}puts("TAK");for(i = 1 ; i <= cnt ; i ++ ) printf("%d %d %d\n" , x[i] , y[i] , z[i]);return 0;
}