#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>

struct Flower
{
	int x, y, z, w;
	double r;  //TIPS: 对于两个不同四维点(x1,y1,z1,w1),(x2,y2,z2,w2)，可以确定一条直线，直线上的任意点(x,y,z,w)，都存在唯一对应实数λ使得(x,y,z,w)=(x1+λ*(x2-x1),y1+λ*(y2-y1),z1+λ*(z2-z1),w1+λ*(w2-w1))
};
struct Flower flower[1005];
using namespace std;

bool check(int line1, int line2, int point){
	flower[point].r = (flower[point].x - flower[line1].x) / (flower[line2].x + flower[line1].x);
	double r2, r3, r4;
	r2 = (flower[point].y - flower[line1].y) / (flower[line2].y + flower[line1].y);
	r3 = (flower[point].z - flower[line1].z) / (flower[line2].z + flower[line1].z);
	r4 = (flower[point].w - flower[line1].w) / (flower[line2].w + flower[line1].w);
	if(flower[point].r == r2 && r2 == r3 && r3 == r4) return true;
	else return false;
}
int main()
{
	int n, ans = 0;
	freopen("xumingshi.in","r",stdin);
	freopen("xumingshi.out","w",stdout);
	scanf("%d", &n);
	for(int i = 1; i <= n; i++)
		scanf("%d%d%d%d", &flower[i].x, &flower[i].y, &flower[i].z, &flower[i].w);
	for(int i = 1; i <= n-2; i++)
		for(int j = i+1; j <= n-1; j++)
			for(int k = j+1; k <= n; k++)
				if(check(1,2,3)) ans++;
	printf("%d", ans);
	return 0;
}