#include<iostream>

#include<cstdio>

#include<cstdlib>

#include<cstring>

#include<cmath>

#include<map>

#include<set>

#include<vector>

#include<algorithm>

#include<stack>

#include<queue>

#include<cctype>

#include<sstream>

using namespace std;

#define INF 1000000000

#define eps 1e-8

#define pii pair<int,int>

#define LL long long int

#define maxn 4005

int T,n,A[maxn],B[maxn],C[maxn],D[maxn],sum[maxn*maxn];

int main()

{

    //freopen("in8.txt","r",stdin);

    //freopen("out.txt","w",stdout);

    scanf("%d",&T);

    while(T--)

    {

        scanf("%d",&n);

        for(int i=;i<n;i++)

        {

            scanf("%d%d%d%d",&A[i],&B[i],&C[i],&D[i]);

        }

        int c=;

        for(int i=;i<n;i++)

        {

            for(int j=;j<n;j++)

            {

                sum[c++]=A[i]+B[j];

            }

        }

        sort(sum,sum+c);

        LL ans=;

        for(int i=;i<n;i++)

        {

            for(int j=;j<n;j++)

            {

                ans+=upper_bound(sum,sum+c,-C[i]-D[j])-lower_bound(sum,sum+c,-C[i]-D[j]);

                //这一句是全篇的点睛之笔。

            }

        }

        printf("%lld\n",ans);

        if(T) printf("\n");

    }

    //fclose(stdin);

    //fclose(stdout);

    return ;

}