#include<iostream>
#include<algorithm>
using namespace std;
 
int a[4][4001];
int b[16000100];
int c[16000100];
main()
{   int n,i,j;
    scanf("%d",&n);
    for(i=0;i<n;i++) scanf("%d %d %d %d",&a[0][i],&a[1][i],&a[2][i],&a[3][i]);
 
    int k=0;
    for(i=0;i<n;i++) 
    for(j=0;j<n;j++)
    {    
            b[k]=a[0][i]+a[1][j];
            c[k]=a[2][i]+a[3][j];          
            k++;
    }
    int size=n*n;
    sort(b,b+size);
    sort(c,c+size);
 
    int count=0;
    for(i=0;i<size;i++)
    if(binary_search(c,c+size,-b[i]))
    count++;
    printf("%d",count);     
    system("pause");
    return 0;
}
 

I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPGFsZ29yaXRobT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKIAppbnQgYVs0XVs0MDAxXTsKaW50IGJbMTYwMDAxMDBdOwppbnQgY1sxNjAwMDEwMF07Cm1haW4oKQp7ICAgaW50IG4saSxqOwogICAgc2NhbmYoIiVkIiwmbik7CiAgICBmb3IoaT0wO2k8bjtpKyspIHNjYW5mKCIlZCAlZCAlZCAlZCIsJmFbMF1baV0sJmFbMV1baV0sJmFbMl1baV0sJmFbM11baV0pOwogICAgCiAgICBpbnQgaz0wOwogICAgZm9yKGk9MDtpPG47aSsrKSAKICAgIGZvcihqPTA7ajxuO2orKykKICAgIHsgICAgCiAgICAgICAgICAgIGJba109YVswXVtpXSthWzFdW2pdOwogICAgICAgICAgICBjW2tdPWFbMl1baV0rYVszXVtqXTsgICAgICAgICAgCiAgICAgICAgICAgIGsrKzsKICAgIH0KICAgIGludCBzaXplPW4qbjsKICAgIHNvcnQoYixiK3NpemUpOwogICAgc29ydChjLGMrc2l6ZSk7CiAgICAKICAgIGludCBjb3VudD0wOwogICAgZm9yKGk9MDtpPHNpemU7aSsrKQogICAgaWYoYmluYXJ5X3NlYXJjaChjLGMrc2l6ZSwtYltpXSkpCiAgICBjb3VudCsrOwogICAgcHJpbnRmKCIlZCIsY291bnQpOyAgICAgCiAgICBzeXN0ZW0oInBhdXNlIik7CiAgICByZXR1cm4gMDsKfQog

NgotNDUgMjIgNDIgLTE2Ci00MSAtMjcgNTYgMzAKLTM2IDUzIC0zNyA3NwotMzYgMzAgLTc1IC00NgoyNiAtMzggLTEwIDYyCi0zMiAtNTQgLTYgNDU=

6
-45 22 42 -16
-41 -27 56 30
-36 53 -37 77
-36 30 -75 -46
26 -38 -10 62
-32 -54 -6 45