Full Turn
There are $$$n$$$ persons located on a plane. The $$$i$$$-th person is located at the point $$$(x_i, y_i)$$$ and initially looks at the point $$$(u_i, v_i)$$$.At the same moment of time, all persons will start to rotate clockwise synchronously with the same angular speed. They will rotate until they do one full $$$360$$$-degree turn. It is said that persons $$$A$$$ and $$$B$$$ made eye contact if person $$$A$$$ looks in person $$$B$$$'s direction at the same moment when person $$$B$$$ looks in person $$$A$$$'s direction. If there is a person $$$C$$$ located between persons $$$A$$$ and $$$B$$$, that will not obstruct $$$A$$$ and $$$B$$$ from making eye contact. A person can make eye contact with more than one person at the same time.Calculate the number of pairs of persons that will make eye contact at least once during the rotation (including the initial moment).
The first line contains one integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases.The first line of each test case contains a single integer $$$n$$$ ($$$1 \le n \le 10^5$$$) — the number of persons. The following $$$n$$$ lines describe persons, each line containing four space-separated integers $$$x_i, y_i, u_i, v_i$$$ ($$$|x_i|, |y_i|, |u_i|, |v_i| \le 10^9$$$; $$$x_i \ne u_i$$$ or $$$y_i \ne v_i$$$), where ($$$x_i, y_i$$$) are the coordinates of the point where the $$$i$$$-th person is located and ($$$u_i$$$, $$$v_i$$$) are the coordinates of the point that the $$$i$$$-th person looks at initially. Each person's location is unique in each test case.The sum of $$$n$$$ over all test cases does not exceed $$$10^5$$$.
For each test case, print one integer — the number of pairs of persons who will make eye contact at least once during the rotation, including the initial moment.
import math
from collections import Counter
t = int(input())
for _ in range(t):
    ans = 0
    cnt = Counter()
    n = int(input())
    sploe = {}
    for _ in range(n):
        (x, y, u, v) = map(int, input().split())
        dx = u - x
        dy = v - y
        g = math.gcd(dx, dy)
        dx //= g
        dy //= g
        ans += cnt[-dx, -dy]
        cnt[dx, dy] += 1
    print(ans)
import sys
from math import gcd
input = sys.stdin.readline
for _ in range(int(input())):
    vects = []
    case = dict()
    for _ in range(int(input())):
        (x, y, u, v) = list(map(int, input().split()))
        if x == u:
            vect = (0, (v - y) // abs(v - y))
        elif y == v:
            vect = ((u - x) // abs(u - x), 0)
        else:
            g = gcd(x - u, v - y)
            vect = ((u - x) // g, (v - y) // g)
        if vect in case:
            case[vect] += 1
        else:
            case[vect] = 1
    s = 0
    for ((a, b), val) in case.items():
        s += val * case.get((-a, -b), 0)
    print(s // 2)
import math
from collections import Counter, defaultdict, deque
from itertools import accumulate, combinations, permutations, count, product
inf = math.inf

def I():
    return input()

def II():
    return int(input())

def MII():
    return map(int, input().split())

def LI():
    return list(input().split())

def LII():
    return list(map(int, input().split()))

def LFI():
    return list(map(float, input().split()))

def GMI():
    return map(lambda x: int(x) - 1, input().split())

def LGMI():
    return list(map(lambda x: int(x) - 1, input().split()))

def quick_pow(x, n, mod):
    res = 1
    while n > 0:
        if n & 1:
            res = res * x % mod
        x = x * x % mod
        n >>= 1
    return res

class UnionFind:

    def __init__(self, n):
        self.parent = list(range(n))

    def find(self, a):
        a = self.parent[a]
        acopy = a
        while a != self.parent[a]:
            a = self.parent[a]
        while acopy != a:
            (self.parent[acopy], acopy) = (a, self.parent[acopy])
        return a

    def merge(self, a, b):
        (pa, pb) = (self.find(a), self.find(b))
        if pa == pb:
            return False
        self.parent[pb] = pa
        return True

class BIT:

    def __init__(self, n):
        self.n = n
        self.data = [0] * (n + 1)

    def add(self, i, x):
        while i <= self.n:
            self.data[i] += x
            i += i & -i

    def sum(self, i):
        s = 0
        while i > 0:
            s += self.data[i]
            i -= i & -i
        return s

def main():
    n = II()
    ans = 0
    cnt = Counter()
    for _ in range(n):
        (x, y, u, v) = MII()
        dx = u - x
        dy = v - y
        g = math.gcd(dx, dy)
        dx //= g
        dy //= g
        ans += cnt[dx, dy]
        cnt[-dx, -dy] += 1
    print(ans)
    return
t = II()
for _ in range(t):
    main()