Triangles made from lines

Sanggeun has $N$ lines on the coordinate plane. The $i$th line is written as $A_i x + B_i y + C_i = 0$.

Write a program that counts the triangles you can build by picking three of his lines.

No three lines meet at one point.

The first line contains the number of lines $N$. ($1 \le N \le 300{,}000$)

Each of the next $N$ lines contains $A_i$, $B_i$, $C_i$ of the $i$th line. Every number is an integer whose absolute value is at most $10^9$, and no line has $A_i$ and $B_i$ both equal to 0.

Print the number of triangles the given lines build. The count can be very large, so print it modulo 1,000,000,007.