/// 最好的
/// 愛生活，之後愛別人

#include <iostream>
#include <cstdio>

using namespace std;

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

int n;
int x[N], y[N], z[N];
ll dp[L];
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 mod = L - 1; mod >= 2; mod--) {
    for (int mod2 = 2 * mod; mod2 < L; mod2 += mod) {
      dp[mod] -= dp[mod2];
    }
    for (int i = 1; i <= n; i++) {
      int a = x[i] % mod;
      int b = y[i] % mod;
      int c = z[i] % mod;
      int ia = (mod - a) % mod;
      int ib = (mod - b) % mod;
      int ic = (mod - c) % mod;
      dp[mod] += f[ia][ib][ic];
      f[a][b][c]++;
    }
    for (int i = 1; i <= n; i++) {
      f[x[i] % mod][y[i] % mod][z[i] % mod]--;
    }
  }

  ll ans = 0;
  for (int mod = 2; mod < L; mod++) {
    ans += dp[mod];
  }
  cout << ans << "\n";

  return 0;
}