#include <bits/stdc++.h>
using namespace std;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n;
  cin >> n;
  vector<array<int, 5>> a(n);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 5; j++) {
      cin >> a[i][j];
    }
  }
  array<int, 5> tmp;
  auto check = [&]() {
    for (auto &cur : a) {
      if (tmp == cur) return false;
      bool fl = false;
      for (int i = 0; i < 5; i++) {
        bool ok = true;
        for (int j = 0; j < 5; j++) {
          if (j != i) {
            ok &= tmp[j] == cur[j];
          }
        }
        fl |= ok;
      }
      for (int i = 0; i + 1 < 5; i++) {
        bool ok = true;
        for (int j = 0; j < 5; j++) {
          if (j != i && j != i + 1) {
            ok &= tmp[j] == cur[j];
          } else if (j == i) {
            int v1 = ((tmp[j] - cur[j]) % 10 + 10) % 10;
            int v2 = ((tmp[j + 1] - cur[j + 1]) % 10 + 10) % 10;
            ok &= v1 == v2;
          }
        }
        fl |= ok;
      }
      if (!fl) return false;
    }
    return true;
  };
  int ans = 0;
  auto dfs = [&](auto self, int pos)->void {
    if (pos == 5) {
      ans += check();
      return;
    }
    for (int i = 0; i < 10; i++) {
      tmp[pos] = i;
      self(self, pos + 1);
    }
  };
  dfs(dfs, 0);
  cout << ans << "\n";
  return 0;
}