시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 256 MB115440.000%

## 문제

Jakob’s laptop broke down, so he decided to build a new one by himself. After getting all the electronic parts, he needs to build a case. He decides to build one out of plywood, cut into pieces and glued together. He learns that, using the laser cutter of the FAU FABLAB, he can cut plywood sheets simply by creating a vector drawing. After some work, he has made a vector drawing. However, his drawing and calculating skills are rather poor, so he wants you to check his drawing.

Figure 1 – Jakob’s Laptop

The drawing consists of a number of polylines that are supposed to be non-self-intersecting polygons (which you have to check). To make things easier, all the lines that make up the polylines are parallel to either the x- or the y axis. Also, two polygons should not touch or intersect. Lastly, one part may contain some holes for plugging in other parts or electronics. However, a hole does not contain other parts or other holes. As parts and holes are both described by polygons, this means that any one polygon may be inside one other polygon, but not inside two other polygons.

## 입력

The input starts with the number of test cases t (with t ≤ 10), on a line. Each test case starts with the number of polylines p (with p < 50), on a line. Every polyline starts with the number of coordinates n, with 5 ≤ n ≤ 50. The next line contains 2n numbers, the x and y coordinates of the points on the polyline. You may assume that, given any two neighbouring points of a polyline, exactly one of their coordinates differ, i.e. all parts of a polyline are parallel to either x or y axis, and have non-zero length. The coordinates are integers between 0 and 106.

## 출력

For each test case: If a polyline does not intersect with itself only on its first and last point, print “INVALID POLYGON”. Else, if two polygons touch or intersect, print “INTERSECTING POLYGONS”. Else, if polygons are nested too deeply, print “INVALID NESTING”. Lastly, if the description is correct, print “CORRECT”.

## 예제 입력 1

4
3
9
0 0 0 3 2 3 2 5 5 5 5 2 3 2 3 0 0 0
5
1 1 1 2 2 2 2 1 1 1
5
3 3 3 4 4 4 4 3 3 3
1
6
0 0 0 2 0 1 1 1 1 0 0 0
3
5
2 2 2 3 3 3 3 2 2 2
5
1 1 1 4 4 4 4 1 1 1
5
0 0 0 5 5 5 5 0 0 0
2
5
1 0 2 0 2 3 1 3 1 0
5
0 2 3 2 3 5 0 5 0 2


## 예제 출력 1

CORRECT
INVALID POLYGON
INVALID NESTING
INTERSECTING POLYGONS


## 힌트

Figure 2 – Drawings of the four sample test cases.