#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;

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);

  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d %d %d", &x[i], &y[i], &z[i]);
  }

  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;
    }
    memset(f, 0, sizeof f);
    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]]]++;
    }
  }

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