시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
12 초 1024 MB 16 6 3 33.333%

## 문제

Where is Polly Polygon? She’s somewhere in the midst of a field of lines.

Given a set of lines, count how many non-self-intersecting polygons can be formed with exactly one segment from each line. Trivial segments (i.e., length 0) do not count. The polygon must contain exactly the same number of distinct vertices as there are lines in the field.

## 입력

The first line of input contains an integer $n$ ($3 \le n \le 12$), which is the number of lines in the plane.

Each of the next n lines contains four integer coordinate values $x_1$, $y_1$, $x_2$ and $y_2$ (all between −2,000 and 2,000 inclusive), representing a line through points ($x_1$, $y_1$) and ($x_2$, $y_2$). Note that they describe an infinite line, not just a line segment. All lines will be distinct. The two points defining a line will be distinct.

The input lines may be parallel. There may be points where more than two lines intersect. Intersections between lines may occur at points with coordinates greater than 2,000.

## 출력

Output a single integer, which is the number of non-self-intersecting polygons that can be formed with exactly one segment from each line.

## 예제 입력 1

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


## 예제 출력 1

2


## 예제 입력 2

7
0 0 0 1
1 0 1 1
2 0 2 1
0 0 1 0
0 1 1 1
0 2 1 2
0 3 1 3


## 예제 출력 2

0


## 예제 입력 3

4
0 1 0 -1
1 0 -1 0
1 1 -1 -1
1 -1 -1 1


## 예제 출력 3

0