#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long dfs(vector<int> cnt, vector<long long> &finv, long long prod, int rem, int p){
  if (p == 8){
    if (rem <= cnt[1]){
      return prod * finv[rem] % MOD;
    } else {
      return 0;
    }
  } else {
    int sz = cnt.size();
    long long ans = 0;
    for (int i = 0; i <= min(rem, cnt[1]); i++){
      vector<int> cnt2(sz / 2);
      for (int j = 0; j < sz / 2; j++){
        cnt2[j] = min(cnt[j * 2], cnt[j * 2 + 1] - i);
      }
      ans += dfs(cnt2, finv, prod * finv[i] % MOD, rem - i, p + 1);
    }
    ans %= MOD;
    return ans;
  }
}
int main(){
  int N;
  cin >> N;
  vector<vector<int>> S(N, vector<int>(6));
  for (int i = 0; i < N; i++){
    for (int j = 0; j < 6; j++){
      cin >> S[i][j];
      S[i][j]--;
    }
  }
  vector<int> cnt(1 << 9, 0);
  for (int i = 0; i < (1 << 9); i++){
    for (int j = 0; j < N; j++){
      bool ok = false;
      for (int k = 0; k < 6; k++){
        if ((i >> S[j][k] & 1) == 1){
          ok = true;
        }
      }
      if (ok){
        cnt[i]++;
      }
    }
  }
  vector<long long> inv(N + 1);
  inv[1] = 1;
  for (int i = 2; i <= N; i++){
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
  }
  vector<long long> fact(N + 1), finv(N + 1);
  fact[0] = 1;
  finv[0] = 1;
  for (int i = 1; i <= N; i++){
    fact[i] = fact[i - 1] * i % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
  long long ans = dfs(cnt, finv, fact[N], N, 0);
  cout << ans << endl;
}