#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;

const int maxn=4010;

int n;
int s1[maxn*maxn];
int s2[maxn*maxn];
int a[maxn],b[maxn],c[maxn],d[maxn];

int main()
{
//   freopen("in.txt", "r", stdin);
    while(~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[i*n+j]=a[i]+b[j];
    for (int i=0;i<n;i++)
        for (int j=0;j<n;j++)
            s2[i*n+j] = c[i]+d[j];
    sort(s1,s1+n*n);
    sort(s2,s2+n*n);
    int r = n*n-1;
    int ans =0;
    for (int i=0;i<n*n;i++)
    {
        while(r>=0 && s1[i]+s2[r]>0)
            r--;
        if (r < 0)break;
        int tmp = r;
        while (tmp >= 0 && s1[i]+s2[tmp] == 0)
            ans++, tmp--;
    }
    printf("%d\n", ans);
    }
    return 0;
}