#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<queue>
using namespace std;
int n,i,j,k;
int ans=0;
struct hua{
	int x,y,z,w;
}h[1001];
int pd(int a,int b,int c)//c是否在ab直线上 
{
	if((h[c].x-h[a].x)/(h[b].x-h[a].x)==(h[c].y-h[a].y)/(h[b].y-h[a].y)==(h[c].z-h[a].z)/(h[b].z-h[a].z)==(h[c].w-h[a].w)/(h[b].w-h[a].w))
	  return 0;
	else return 1;
}
int main()
{
	freopen("xumingshi.in","r",stdin);
	freopen("xumingshi.out","w",stdout);
	cin>>n;
	for(i=0;i<n;i++)
	  {
	  	cin>>h[i].x>>h[i].y>>h[i].z>>h[i].w;
	  }
	for(i=0;i<n;i++)
	  {
	  	for(j=i;j<n;j++)
	  	  {
	  	  	for(k=j;k<n;k++)
	  	  	  {
	  	  	  	if(pd(i,j,k)==0) ans++;
	  	  	  }
	  	  }
	  }
	cout<<ans;
	fclose(stdin);fclose(stdout);
	return 0;
}