Given $n$ horizontal and vertical lines, your task is to calculate the number of their intersection points.

You can assume that the lines are all distinct.

Input

The first input line has an integer $n$: the number of lines.

Then there are $n$ lines describing the lines. Each line has four integers: $x_1$, $y_1$, $x_2$ and $y_2$: a line that pass through the points $(x_1,y_1)$ and $(x_2,y_2)$.

Output

Print the number of intersection points.

Constraints

• $1 \le n \le 10^5$
• $-10^6 \le x_1, x_2 \le 10^6$
• $-10^6 \le y_1, y_2 \le 10^6$
• $(x_1,y_1) \neq (x_2,y_2)$

Example

Input:

3
2 3 7 3
3 1 3 5
6 2 6 6

Output:

2