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
#include <cstdio>
#include <algorithm>

using namespace std;

pair<int, int> t[1 << 20];



int main()
{
  int z;
  scanf("%d", &z);
  while (z > 0)
  {
    z--;
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
      int l, a, b;
      scanf("%d%d%d", &l, &a, &b);
      
      t[i] = {a, b};
      
    }
    
    
    sort(t, t + n, [] (pair<int, int> p1, pair<int, int> p2) 
      { if (p1.first - p1.second < p2.first - p2.second) return true;
        if (p1.first - p1.second == p2.first - p2.second) 
          return p1.first < p2.first;
        return false;
      } );
    
    for (int i = 0; i < n; i++)
    {
      //printf("%d %d\n", t[i].first, t[i].second);
    }
    
    int l = 0, r = n - 1;
    bool ok = true;
    while (l <= r)
    {
      int d1 = t[l].first - t[l].second;
      int d2 = t[r].first - t[r].second;
      if (d1 != -d2)
      {
        ok = false;
        break;
      }
      l++;
      r--;
    }
    
    if (ok)
    {
      l = 0, r = n - 1;
      while (l <= r)
      {
        int pop = t[l].first - t[l].second;
        int k = 0;
        int popl = l, popr = r;
        while ( (l <= r) && (pop == t[l].first - t[l].second) && (-pop == t[r].first - t[r].second))
        {
          int a = t[l].first;
          int b = t[l].second;
          int c = t[r].first;
          int d = t[r].second;
          if (a == c && (b != a || c != d))
          {
            ok = false;
          }
          
          if (b - c < 0 && a - c > 0)
          {
            ok = false;
          }
  
          if (b - c > 0 && a - c < 0)
          {
            ok = false;
          }
          k++;
          l++;
          r--;
        }
        if (!ok)
        {
          ok = true;
          int ll = popl;
          int rr = r;
          while (k > 0)
          {
            rr++;
            int a = t[ll].first;
            int b = t[ll].second;
            int c = t[rr].first;
            int d = t[rr].second;
            ll++;
            if (a == c && (b != a || c != d))
            {
              ok = false;
            }
            
            if (b - c < 0 && a - c > 0)
            {
              ok = false;
            }
    
            if (b - c > 0 && a - c < 0)
            {
              ok = false;
            }
            k--;
          }
        }
        if (!ok) break;
      }
    }
    if (ok)
    {
      printf("TAK\n");
    }
    else
    {
      printf("NIE\n");
    }
  }
  
  return 0;
}