Superknight

On an infinite chequered board there is a superknight that can make several kinds of moves. Each kind of move is described by two integers. The first tells how many columns the knight traverses (to the right if the number is positive, to the left if it is negative), and the second tells how many rows it traverses (forward if the number is positive, backward if it is negative).

Write a program that:

• reads from standard input the data describing several superknights,
• determines for each superknight whether it can reach any square of the board using only the allowed moves,
• writes the results to standard output.

The first line of input contains one integer $k$, the number of data sets ($1 \le k \le 100$). It is followed by $k$ data sets. The first line of each set contains an integer $n$, the number of kinds of moves the superknight can make ($1 \le n \le 100$). Each of the next $n$ lines contains two integers $p$ and $q$ separated by a single space ($-100 \le p, q \le 100$), describing one kind of move.

The output should consist of $k$ lines. The $i$-th line should contain the word TAK ("yes") if the superknight described by the $i$-th data set can reach any square of the board, or the word NIE ("no") otherwise.