A1529.[COCI-2013_2014-contest5]#6 TROKUTI
省选/NOI-
COCI
通过率：0%
时间限制：1.00s
内存限制：128MB
题目描述
You are given N lines, their equations being Ai x + Bi y + Ci = 0 in the coordinate plane. Calculate the number of triangles whose sides lie on the given lines. Since the result can be very large, output the number modulo 1 000 000 00
7.
Important note: No three lines will intersect at the same point.
输入格式
The first line of input contains the integer N (1 ≤ N ≤ 300 000), the number of lines.
Each of the following N lines contains three integers: Ai , Bi and Ci , the numbers defining the i th line.
All numbers will be lesser than 10^
9.
输出格式
The first and only line of output must consist of the required number from the task.
输入输出样例
输入#1
6 0 1 0 -5 3 0 -5 -2 25 0 1 -3 0 1 -2 -4 -5 29
输出#1
10
输入#2
5 -5 3 0 -5 -3 -30 0 1 0 3 7 35 1 -2 -1
输出#2
10
说明/提示
In test cases worth 40% of total points, N will be lesser than 1000.