A line segment is said to be fixed if two distinct points on the line are fixed.
Given several lines on a plane, let's calculate the minimum number of points needed to fix these lines on the plane.
Input
One integer 't' stating the number of test cases, followed by 't' blocks.
One integer 'n' specifying the number of line segments, followed by n pairs of coordinates specifying the ends of the segments. All coordinates are at the format of (x, y). the number n does not exceed 7.
Output
One integer a line stating the points needed to fix the line segments.
Sample Input
1
2
1 1 2 1
2 2 3 2
Sample Output
4
