## What-the-Mole

#### 문제

Wonha works for a game development company nowadays. He had to learn several technologies, but he was tired of reading technical documents. So he decided to write and demonstrate a simple game. The name is chosen as "What-the-Mole" (due to copyright issues).

What-the-Mole contains a game panel that simply consists of nine holes that are aligned as a 3 \times 3$3 \times 3$ grid. N$N$ moles appear on the holes randomly in position and time, and the objective of the game is to hit these moles as many times as possible.

A player uses a cursor to hit the moles. At the start of the game, cursor is on the top-left hole. There are two actions that the player may do. One action is to move the cursor to its adjacent holes (two holes are adjacent if they share an edge on the grid), and it takes 0.9 seconds. Note that the player cannot do anything else with the cursor while moving.

Another action is to swing the hammer on the current hole where the cursor is on. It's a little bit complicated as some animations and effects should be played. If a player tries to hit the mole, animations are played for 0.1 seconds. After that, the judgment of whether the hitting is successful or not takes place; if there is a mole, then the hitting is judged as successful, otherwise not. Successful hitting scores one point, and the hit mole will disappear immediately. If a mole appears exactly at the same time of the judgment, it will be judged as a successful hitting.

The moles will appear after a non-negative integer number of seconds after the start of the game, and will disappear 2.75 seconds after the appearance. Let us denote the duration of the appearance of the i$i$-th mole as T_i$T_i$, and the coordinates of the hole at which the i$i$-th mole appears as (R_i, C_i)$(R_i, C_i)$. The mole will appear on the hole located at R_i$R_i$-th row and C_i$C_i$-th column, at time T_i$T_i$.

Wonha was worried about the case where two or more moles appear and occupy the same hole -- notice that even if two moles appear at different times, they can still occupy the same hole if their appearance time intervals overlap. Thus, he made some tricks in his program to avoid such cases -- even if a player does not hit any moles, it is guaranteed that, at any point in time, no two moles will occupy the same hole at the same time. The game will end when the last mole disappears.

Wonha tested the game several times, and he found that his pseudo-random number generator is broken. If he changes the system time to specific moment and clicks the menu button several times, the pattern of the game will always be the same, just like Pokemon's RNG trick. Now he is curious about the maximum score for this specific pattern of the game. Help him to find out maximum score, given how the moles will appear and disappear.

#### 입력

Your program is to read from standard input. The input consists of T$T$ test cases.
The number of test cases T$T$ is given in the first line of the input.
The first line of each test case contains an integer, N$N$.
Each line of the next N lines contains three integers R_i, C_i \; (1 \le R_i, C_i \le 3)$R_i, C_i \; (1 \le R_i, C_i \le 3)$, and T_i \;(0 \le T_i \le 100)$T_i \;(0 \le T_i \le 100)$, separated by space(s). Each line describes when and where a mole appears.

#### 출력

Your program is to write to standard output. Print exactly one line for each test case.
The line should contain a single integer: the maximum score for a given game pattern.

#### 예제 입력

1
4
1 1 0
2 2 1
3 3 0
3 3 3


#### 예제 출력

3