#include <cstdio>
#include <cctype>

using namespace std;


const int SIZE = 1 << 17;
int pointer = SIZE;
char buffer[SIZE];

char Advance() {
  if (pointer == SIZE) {
    fread(buffer, 1, SIZE, stdin);
    pointer = 0;
  }
  return buffer[pointer++];
}

int Read() {
  int answer = 0;
  char ch = Advance();
  while (!isdigit(ch)) {
    ch = Advance();
  }
  while (isdigit(ch)) {
    answer = answer * 10 + ch - '0';
    ch = Advance();
  }
  return answer;
}

typedef long long ll;
const int N = 100000 + 7;
const int L = 65;
const int T = 2 * L;

int n, ia, ib, ic;
int x[N], y[N], z[N];
ll dp[T];
int mod[T];
int f[L][L][L];

int main() {
  freopen ("puteri.in", "r", stdin);
  freopen ("puteri.out", "w", stdout);

  n = Read();
  for (int i = 1; i <= n; i++) {
    x[i] = Read();
    y[i] = Read();
    z[i] = Read();
  }

  for (int i = T - 1; i >= 2; i--) {
    for (int j = 2 * i; j < T; j += i) {
      dp[i] -= dp[j];
    }
    for (int j = 0; j < T; j++) {
      mod[j] = j % i;
    }
    for (int j = 1; j <= n; j++) {
      ia = mod[i - mod[x[j]]], ib = mod[i - mod[y[j]]], ic = mod[i - mod[z[j]]];
      if (ia < L && ib < L && ic < L) {
        dp[i] += f[ia][ib][ic];
      }
      f[mod[x[j]]][mod[y[j]]][mod[z[j]]]++;
    }
    for (int j = 1; j <= n; j++) {
      f[mod[x[j]]][mod[y[j]]][mod[z[j]]]--;
    }
  }

  ll ans = 0;
  for (int i = 2; i < T; i++) {
    ans += dp[i];
  }
  printf("%lld\n", ans);
  return 0;
}