**Description**

The CE digital company has built an
Automatic Painting Machine (APM) to paint a flat board fully covered by adjacent
non-overlapping rectangles of different sizes each with a predefined color.

To avoid leaking the paints and mixing colors, a rectangle can only be painted if all rectangles immediately above it have already been painted. For example rectangle labeled F in Figure 1 is painted only after rectangles C and D are painted. Note that each rectangle must be painted at once, i.e. partial painting of one rectangle is not allowed.

You are to write a program for APM to paint a given board so that the number of brush pick-ups is minimum. Notice that if one brush is picked up more than once, all pick-ups are counted.

กก

**Input**

The first line of the input file
contains an integer M which is the number of test cases to solve (1 <= M
<= 10). For each test case, the first line contains an integer N, the number
of rectangles, followed by N lines describing the rectangles. Each rectangle R
is specified by 5 integers in one line: the y and x coordinates of the upper
left corner of R, the y and x coordinates of the lower right corner of R,
followed by the color-code of R.

Note that:

- Color-code is an integer in the range of 1 .. 20.

- Upper left corner of the board coordinates is always (0,0).

- Coordinates are in the range of 0 .. 99.

- N is in the range of 1..15.

กก

**Output**

One line for each test case showing the minimum number of brush pick-ups.

**Sample Input**

1 7 0 0 2 2 1 0 2 1 6 2 2 0 4 2 1 1 2 4 4 2 1 4 3 6 1 4 0 6 4 1 3 4 6 6 2

กก

**Sample Output**

3

กก

**Source**

Tehran 1999