#include <bits/stdc++.h>
using namespace std;
int a[2600],b[2600],c[2600],d[2600];
vector <int> s1,s2;
int main()
{
    int n,ans=0;
    scanf("%d",&n);
    for (int i=0;i<n;i++)
    {
        scanf("%d %d %d %d",&a[i],&b[i],&c[i],&d[i]);
    }
    for (int i=0;i<n;i++)
    {
        for (int j=0;j<n;j++)
        {
            s1.push_back(a[i]+b[j]);
            s2.push_back(c[i]+d[j]);
        }
    }
    sort(s1.begin(),s1.end());
    sort(s2.begin(),s2.end());
    for (int i=0;i<s1.size();i++)
    {
        int num=upper_bound(s1.begin(),s1.end(),s1[i])-lower_bound(s1.begin(),s1.end(),s1[i]);
        if (binary_search(s2.begin(),s2.end(),-s1[i]))
        {
            ans+=num;
        }
    }
    printf("%d\n",ans);



    return 0;
}