#include <fstream>

using namespace std;

ifstream fin("puteri.in");
ofstream fout("puteri.out");

typedef long long i64;

const int nmax= 100000;
const int nrmax= 128;
const int pmax= 64;

bool p[nrmax+1];
int a[nmax+1], b[nmax+1], c[nmax+1], v[nrmax+1], d[pmax+1][pmax+1][pmax+1][2], sign[nrmax+1];

int main(  ) {
    int n;
    fin>>n;
    for ( int i= 1; i<=n; ++i ) {
        fin>>a[i]>>b[i]>>c[i];
    }

    i64 sol= 0;
    for ( int i= 2; i<=nrmax; ++i ) {
        sign[i]= -1;
    }
    for ( int i= 2; i<=nrmax; ++i ) {
        if ( p[i]==0 ) {
            for ( int j= i; j<=nrmax; j+= i ) {
                sign[j]*= -1;
            }
            for ( int j= i*i; j<=nrmax; j+= i*i ) {
                sign[j]= 0;
            }

            for ( int j= i*i; j<=nrmax; j+= i ) {
                p[i]= 1;
            }
        }

        if ( sign[i]!=0 ) {
            i64 ans= 0;
            for ( int j= 0; j<=nrmax; ++j ) {
                v[j]= j%i;
            }
            for ( int j= 1; j<=n; ++j ) {
                if ( v[i-v[a[j]]]<=pmax && v[i-v[b[j]]]<=pmax && v[i-v[c[j]]]<=pmax && d[v[i-v[a[j]]]][v[i-v[b[j]]]][v[i-v[c[j]]]][0]==i ) {
                    ans+= d[v[i-v[a[j]]]][v[i-v[b[j]]]][v[i-v[c[j]]]][1];
                }

                if ( d[v[a[j]]][v[b[j]]][v[c[j]]][0]!=i ) {
                    d[v[a[j]]][v[b[j]]][v[c[j]]][0]= i;
                    d[v[a[j]]][v[b[j]]][v[c[j]]][1]= 0;
                }
                ++d[v[a[j]]][v[b[j]]][v[c[j]]][1];
            }

            sol= sol+sign[i]*ans;
        }
    }

    fout<<sol<<"\n";

    return 0;
}