#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
const ll mo=998244353;
const int NUM_=400001;
static ll fact[NUM_+1],factr[NUM_+1],inv[NUM_+1];

unordered_set<int> M[21];
int add(int mask,int v) {
	int i;
	FOR(i,31) if(mask&(1<<i)) {
		if(v==0) {
			int a=mask&((1<<i)-1);
			return ((mask^a)<<1)^a;
		}
		v--;
	}
	assert(0);
}

void solve() {
	int i,j,k,l,r,x,y; string s;

	inv[1]=fact[0]=factr[0]=1;
	for (int i=2;i<=NUM_;++i) inv[i] = inv[mo % i] * (mo - mo / i) % mo;
	for (int i=1;i<=NUM_;++i) fact[i]=fact[i-1]*i%mo, factr[i]=factr[i-1]*inv[i]%mo;
	
	cin>>N;
	
	M[0].insert((1<<9)-1);
	FOR(i,N) {
		int C[6];
		FOR(j,6) {
			cin>>C[j];
			C[j]--;
		}
		FORR(a,M[i]) {
			FOR(j,6) M[i+1].insert(add(a,C[j]));
		}
	}
	
	ll ret=0;
	FORR(m,M[N]) {
		ll v=fact[N];
		int cur=0;
		FOR(i,31) {
			if(m&(1<<i)) {
				v=v*factr[cur]%mo;
				cur=0;
			}
			else {
				cur++;
			}
		}
		ret+=v;
	}
	cout<<ret%mo<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}