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
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <bitset>

using namespace std;

typedef unsigned long long LL;

#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(val) ((val) < 0 ? -(val) : (val))

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

#define M 1000000007ULL

/* PA2019 "HER", heura*/

bool cmp(const pair<int,int> &a, const pair<int,int> &b) 
{ 
    return (a.second > b.second); 
} 
  
#define PISO 1000005

void solve(int n) {
	
	int want [PISO] = {};
	int have [PISO] = {};
	
	
	int maxt = -1;
	REP(i, n) {
		int L, h, w;
		scanf("%d %d %d", &L, &h, &w);
		
		want[w] += L;
		have[h] += L;
		
		maxt = MAX (maxt, h);
		maxt = MAX (maxt, w);

	}
	
	bool first_t = true;
	int first = -1;
	int last = -1;
	
	int sumh = 0, sumw = 0;
	REP(i, maxt + 1) {
		int mino = MIN(want[i], have[i]);
		want[i] -= mino;
		have[i] -= mino;
		
		//printf("i %d, want[i] %d, have[i] %d, first %d, last %d\n", i, want[i], have[i], first, last);
		if (want[i] || have[i]) {
			if (first_t)
			{
			   first_t = false;
			   first = i;
			}
			
			last = i;
		}

		sumh += have[i] * i;
		sumw += want[i] * i;
	}
	
	if (sumh != sumw) {
		printf("NIE\n");
		return;
	}
	

	if (first != -1)
	{
		if (want[first] > have[first])
		{
			printf ("NIE\n");
			return;
		}
	}
	
	if (last != -1)
	{
		if (want[last] > have[last])
		{
			printf ("NIE\n");
			return;
		}
	}

	

	printf("TAK\n");

	
}


int main() {

	int cases;
	scanf("%d\n", &cases);
	
    REP(i, cases) {
		int n;
		scanf("%d", &n);
		
		solve(n);
	}
		


	return 0;
}