#include <bits/stdc++.h>
using namespace std;
class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
}f("puteri.in");
ofstream g("puteri.out");
bool prim[129];
int n,i,j,a[1<<17],b[1<<17],c[1<<17],bit[129],l[129],s[65][65][65];
long long sol;
inline long long solve(int mod)
{
    int i,a_,b_,c_;
    long long sol=0;
    memset(s,0,sizeof s);
    for(i=0;i<=128;i++) l[i]=i%mod;
    for(i=0;i<n;++i)
    {
        a_=l[mod-l[a[i]]];
        b_=l[mod-l[b[i]]];
        c_=l[mod-l[c[i]]];
        if(a_<=64&&b_<=64&&c_<=64) sol+=s[a_][b_][c_];
        s[l[a[i]]][l[b[i]]][l[c[i]]]++;
    }
    return sol;
}
int main()
{
    f>>n;
    for(i=0;i<n;i++) f>>a[i]>>b[i]>>c[i];
    for(i=2;i<=128;i++) bit[i]=1;
    for(i=2;i<=128;i++)
    {
        if(!prim[i])
        {
            for(j=i;j<=128;j+=i) bit[j]*=-1,prim[j]=1;
            for(j=i*i;j<=128;j+=i*i) bit[j]=0;
        }
        if(bit[i]!=0) sol-=bit[i]*solve(i);
    }
    g<<sol;
    return 0;
}