#include <bits/stdc++.h>

using namespace std;
using pii = pair <int, int>;

inline int untitled(const pii &a) {
    if (a.first < 0) {
        // x < 0
        return a.second < 0 ? 3 : 2;
    }else {
        return a.second < 0 ? 4 : 1;
    }
}

inline bool cmp(const pii &a, const pii &b) {
    int a_ = untitled(a), b_ = untitled(b);
    if (a_ != b_) return a_ < b_;
    // dya / dxa < dyb / dxb
    return 1ll * a.second * b.first < 1ll * a.first * b.second;
}

inline bool cmp2(const pii &a, const pii &b) {
    int a_ = untitled(a), b_ = untitled(b);
    if (a_ != b_) return 0;
    // dya / dxa < dyb / dxb
    return 1ll * a.second * b.first == 1ll * a.first * b.second;
}

const int MAX_N = 1000 + 5;

int N;
struct Segment{
    int x1, y1, x2, y2;
    Segment (int x1_ = 0, int y1_ = 0, int x2_ = 0, int y2_ = 0) : x1(x1_), y1(y1_), x2(x2_), y2(y2_) {}
    inline bool operator < (const Segment &comp) const {
        return cmp(pair(x2 - x1, y2 - y1), pair(comp.x2 - comp.x1, comp.y2 - comp.y1));
        // return atan2(y2 - y1, x2 - x1) < atan2(comp.y2 - comp.y1, comp.x2 - comp.x1);
    }
}seg[MAX_N];
pii node[MAX_N << 1];

inline bool check(const Segment &seg, int x0, int y0) {
    int dx1 = x0 - seg.x1, dy1 = x0 - seg.y1;
    int dx2 = seg.x2 - x0, dy2 = seg.y2 - y0;
    // dy1 / dx1 = dy2 / dx2
    return 1ll * dy1 * dx2 == 1ll * dx1 * dy2 && min(seg.x1, seg.x2) <= x0 && x0 <= max(seg.x1, seg.x2);
}

void solve() {
    cin >> N;
    for (int i = 1; i <= N; i ++) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        node[i] = pair(x1, y1);
        node[i + N] = pair(x2, y2);
        seg[i] = Segment(x1, y1, x2, y2);
    }
    int ans = 0;
    sort(node + 1, node + (N << 1) + 1);
    int M = unique(node + 1, node + (N << 1) + 1) - node - 1;
    for (int i = 1; i <= M; i ++) {
        auto [x0, y0] = node[i];
        vector <Segment> seg1;
        vector <pii> seg2;
        for (int j = 1; j <= N; j ++) {
            if (seg[j].x1 == x0 && seg[j].y1 == y0) {
                seg2.emplace_back(seg[j].x2 - seg[j].x1, seg[j].y2 - seg[j].y1);
            }else if (seg[j].x2 == x0 && seg[j].y2 == y0) {
                seg2.emplace_back(seg[j].x1 - seg[j].x2, seg[j].y1 - seg[j].y2);
            }else if (check(seg[j], x0, y0)) {
                seg1.push_back(seg[j]);
            }
        }
        if (!(seg1.empty() || seg2.empty())) {
            sort(seg1.begin(), seg1.end());
            sort(seg2.begin(), seg2.end(), cmp);
            auto ed = unique(seg2.begin(), seg2.end());
            int n = ed - seg2.begin();
            if(n <= 1) continue;
            int i1 = 0, j1 = n - 1, i2 = n - 1, j2 = 0;
            fprintf(stderr, "n = %d\n", n);
            for (int i = 0; i < n; i ++) fprintf(stderr, "i = %d, dx = %d, dy = %d\n", i, seg2[i].first, seg2[i].second);
            for (int k = 0; k < (int)seg1.size(); k ++) {
                pii dir0 = pair(seg1[k].x2 - seg1[k].x1, seg1[k].y2 - seg1[k].y1);
                pii dir1 = pair(seg1[k].x1 - seg1[k].x2, seg1[k].y1 - seg1[k].y2);
                
                fprintf(stderr, "k = %d, dir0 = (%d, %d), dir1 = (%d, %d)\n", k, dir0.first, dir0.second, dir1.first, dir1.second);
                
                // i1 < dir0, j1 > dir1
                if (cmp(dir0, seg2[i1])) i1 = 0;
                if (cmp(seg2[j1], dir1)) j1 = n - 1;
                while (i1 < n && cmp(seg2[i1], dir0)) i1 ++;
                i1 --; if (i1 < 0) i1 = n - 1;
                while (j1 >= 0 && cmp(dir1, seg2[j1])) j1 --;
                j1 ++; if (j1 == n) j1 = 0;
                
                // i2 > dir0, j2 < dir1
                // if (cmp(seg2[i2], dir0)) i2 = n - 1;
                // if (cmp(dir1, seg2[j2])) j2 = 0;
                // while (i2 >= 0 && cmp(dir0, seg2[i2])) i2 --;
                // i2 ++; if (i2 == n) i2 = 0;
                // while (j2 < n && cmp(seg2[j2], dir1)) j2 ++;
                // j2 --; if (j2 < 0) j2 = n - 1;
                
                int cnt0 = (j1 <= i1 ? i1 - j1 + 1 : n - (j1 - i1 - 1)), cnt1 = n - cnt0;
                i2 = i1 + 1; if (i2 == n) i2 = 0;
                j2 = j1 - 1; if (j2 < 0) j2 = n - 1;
                if (cmp2(seg2[i2], dir0)) cnt1 --;
                if (j2 != i2 && cmp2(seg2[j2], dir1)) cnt1 --;
                
                fprintf(stderr, "cnt0 = %d, cnt1 = %d, i1 = %d, j1 = %d, i2 = %d, j2 = %d\n", cnt0, cnt1, i1, j1, i2, j2);
                
                ans += (cnt0 * (cnt0 - 1) + cnt1 * (cnt1 - 1)) / 2;
            }
        }
    }
    cout << ans << '\n';
    // exit(0);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    int T; cin >> T;
    while (T --) solve();
    
    return 0;
}