You are given sets of N points in two-dimensional space. It is guaranteed that no two points coincide in each set.
For each set, please calculate the number of lines which pass through at least three points in the set.
The first line contains an integer T, representing the number of testcases (sets).
For each testcase (set) :
The first line contains an integer N, representing the number of points in this set.
The next N line contain two integer xi, yi, representing the coordinates of the i-th point. All points in the set are distinct.
For each testcase (set), please output a line contains an integer representing your answer.
(i.e. Please print '\n' after each answer.)