Given n lines, the ith one passes through two distinct points Ai(x1,y2) and Bi(x2,y2). Count the number of pairs 1≤i<j≤n that line i and j are perpendicular. It is guaranteed that Ai≠Bi.
### Input
- The first lines contains an integer n.
- The next n lines, each line contains four integers x1,y1,x2,y2 describing a line.
### Output
- Print the number of satisfied pairs.
### Constraints
- 1≤n≤105.
- −109≤x,y≤109.
### Example
Input:
40010102255001000010-10
Output:
2
