#include <cstdio>
#include <algorithm>
#include <cstring>
#define maxN 100002
#define maxA 129
#define maxB 65
using namespace std;
int n, i, j, valx[maxA], r;
long long sol;
int np[maxB][maxB][maxB];
struct pset
{
    int a;
    int b;
    int c;
} v[maxN];
bool ok(int x)
{
    int i;
    r = 0;
    for (i = 2; i * i <= x; ++ i)
        if (x % i == 0)
        {
            x /= i;
            if (x % i == 0)
                return 0;
            r = 1 - r;
        }
    if (x > 1)
        r = 1 - r;
    if (!r)
        r = -1;
    return 1;
}
void read()
{
    freopen("puteri.in", "r", stdin);
    scanf("%d", &n);
    for (i = 1; i <= n; ++ i)
        scanf("%d %d %d", &v[i].a, &v[i].b, &v[i].c);
}
void solve()
{
    int x, a, b, c;
    for (x = 2; x < maxA; ++ x)
        if (ok(x))
        {
            for (i = 0; i < maxA; ++ i)
                valx[i] = i % x;

            for (i = 1; i <= n; ++ i)
            {
                a = v[i].a;
                b = v[i].b;
                c = v[i].c;

                if (valx[x - valx[a]] < maxB && valx[x - valx[b]] < maxB && valx[x - valx[c]] < maxB)
                    sol += r * np[valx[x - valx[a]]][valx[x - valx[b]]][valx[x - valx[c]]] * 1LL;
                ++ np[valx[a]][valx[b]][valx[c]];
            }
            memset(np, 0, sizeof(np));
        }
}
void write()
{
    freopen("puteri.out", "w", stdout);
    printf("%lld", sol);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}