#include <fstream>
#include <bitset>
using namespace std;

class InParser
{
#pragma warning(disable:4996)
private:
	FILE* fin;
	char* buff;
	int sp;
	char read()
	{
		++sp;
		if (sp == 4096)
		{
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}
public:
	InParser(const char* nume)
	{
		sp = 4095;
		buff = new char[4096];
		fin = fopen(nume, "r");
	}
	InParser& operator >> (int& n)
	{
		char c;
		while (!isdigit(c = read()));
		n = c - '0';
		while (isdigit(c = read()))
			n = n * 10 + c - '0';
		return *this;
	}
};
InParser fin("puteri.in");
ofstream fout("puteri.out");

const int NMAX = 65;

bitset <NMAX> put[NMAX][NMAX];
int p[NMAX][NMAX][NMAX], a, b, c, n;

long long cnt;

int main()
{
	for (int i = 2; i <= 64; ++i)
		for (int j = 0; j <= 64; j += i)
			for (int k = 0; k <= 64; k += i)
			{
				put[i][j][k] = 1;
				put[j][k][i] = 1;
				put[k][i][j] = 1;
			}
	fin >> n;
	while (n--)
	{
		fin >> a >> b >> c;
		for (int i = 0; i <= 64; ++i)
			for (int j = 0; j <= 64; ++j)
				for (int k = 0; k <= 64; ++k)
					if (put[i][j][k])
					{
						int i_a = i - a, j_b = j - b, k_c = k - c;
						if (i_a >= 0 && j_b >= 0 && k_c >= 0)
							cnt += p[i_a][j_b][k_c];
					}
		++p[a][b][c];
	}
	fout << cnt << "\n";
	fout.close();
	return 0;
}