#include <cstdio>
#define nmax 100010

int n, a[nmax], b[nmax], c[nmax], v[66][66][66], sol;

int main()
{
	freopen("puteri.in","r",stdin);
	freopen("puteri.out","w",stdout);
	scanf("%d",&n);
	int i, k, ck, t, f, d, s;
	for (i=1; i<=n; i++) 
		scanf("%d %d %d",&a[i],&b[i],&c[i]);
	for (k=2; k<=128; k++)
	{
		ck=k;
		t=0;
		for (d=2; d*d<=k; d++)
		{
			f=0;
			while (!(ck%d))
			{
				f++;
				ck/=d;
			}
			if (f>1) 
			{
				t=-1;
				break;
			} else 
				if (f==1) t++;
		}
		if (ck>1 && t>-1) t++;
		if (t>-1)
		{
			s=0;
			for (i=1; i<=n; i++)
			{
				if ((k-(a[i]%k))%k<=64 && (k-(b[i]%k))%k<=64 && (k-(c[i]%k))%k<=64)
					s+=v[(k-(a[i]%k))%k][(k-(b[i]%k))%k][(k-(c[i]%k))%k];
				v[a[i]%k][b[i]%k][c[i]%k]++;
			}
			for (i=1; i<=n; i++) v[a[i]%k][b[i]%k][c[i]%k]=0;
			if (t%2) sol+=s; else sol-=s;
		}
	}
	printf("%d\n",sol);
}