#include <stdio.h>
#include <algorithm>
using namespace std;
int v[3][200000];
int i,j,n,sol;
int cmmdc(int a, int b)
{
	if (a == 0)
		a=b;
	if (b == 0)
		b=a;
	if (a == 1)
		b=1;
	if (b == 1)
		a=1;
   
	while (a!=b)
		if (a>b)
			a-=b;
	else if (b>a)
		b-=a;
	return a;
}
int main()
{
	freopen("puteri.in","r",stdin);
	freopen("puteri.out","w",stdout);
	scanf("%d",&n);
	for (i=1;i<=n;++i) scanf("%d %d %d",&v[0][i],&v[1][i],&v[2][i]);
	for (i=1;i<=n;++i)
		for (j=i+1;j<=n;++j) 
		if (cmmdc(cmmdc(v[0][i]+v[0][j],v[1][i]+v[1][j]),v[2][i]+v[2][j])!=1) ++sol;
	printf("%d\n",sol);
	return 0;
}