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

namespace NTT{
	const int MOD=998244353,g=3,ig=332748118;
	const int MAXN=2100000;
	inline long long poww(long long x,long long y){
		long long ret=1;
		while (y){
			if (y&1) ret*=x,ret%=MOD;
			x*=x,x%=MOD;
			y>>=1;
		}
		return ret;
	}
	inline long long inv(long long x){return poww(x,MOD-2);}
	int R[MAXN];
	inline void fft(vector<long long> &a,int L,int ty){
		for (int i=0;i<L;i++) i>R[i]?swap(a[i],a[R[i]]):void(0);
		for (int i=1;i<L;i<<=1){
			long long w=poww(ty,(MOD-1)/(i<<1));
			for (int j=0;j<L;j+=(i<<1)){
				long long wn=1;
				for (int k=j;k<i+j;k++){
					long long t=wn*a[i+k]%MOD;
					a[i+k]=a[k]-t;a[i+k]<0?a[i+k]+=MOD:0;
					a[k]+=t;a[k]>=MOD?a[k]-=MOD:0;
					wn=wn*w%MOD;	
				}
			}
		}
	}
	inline vector<long long> mul(vector<long long> A,vector<long long> B){
		int L=1,n=(int)A.size()-1,m=(int)B.size()-1;
		while (L<=n+m) L<<=1;
		A.resize(L);B.resize(L);
		for (int i=1;i<L;i<<=1)
			for (int j=0;j<i;j++)
				R[i+j]=R[j]+L/(i<<1);
		fft(A,L,g);fft(B,L,g);
		vector<long long> ret(L);
		for (int i=0;i<L;i++) ret[i]=A[i]*B[i]%MOD;
		fft(ret,L,ig);
		long long invL=inv(L);
		for (int i=0;i<L;i++) ret[i]=ret[i]*invL%MOD;
		ret.resize(n+m+1);
		return ret;
	}
}

typedef long long ll;
const int maxn=2100000;
const ll mod=998244353;
ll fac[maxn+50],ifac[maxn+50];
void prepare(){
	fac[0]=1;
	for (int i=1;i<=maxn;i++) fac[i]=fac[i-1]*i%mod;
	ifac[maxn]=NTT::inv(fac[maxn]);
	for (int i=maxn-1;i>=0;i--) ifac[i]=ifac[i+1]*(i+1)%mod;	
}
inline ll getfac(ll n){
	if (n<0) return 0;
	return fac[n];	
}
inline ll C(ll n,ll m){
	if (m<0 || m>n) return 0;
	return fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}

ll n;
ll A[10][10];

int main(){
	ios_base::sync_with_stdio(false);
	prepare();
	
	cin >> n;
	for (int i=0;i<3;i++)
		for (int j=0;j<3;j++) cin >> A[i][j];
	ll ba=(A[0][1]+A[1][1]+A[2][1])-(A[0][0]+A[1][0]+A[2][0]);
	ll ca=(A[0][2]+A[1][2]+A[2][2])-(A[0][0]+A[1][0]+A[2][0]);
	
	ll ed=(A[0][1]+A[1][2]+A[2][0])-(A[0][0]+A[1][1]+A[2][2]);
	ll fd=(A[0][2]+A[1][0]+A[2][1])-(A[0][0]+A[1][1]+A[2][2]);
	
	ll hg=(A[0][1]+A[1][0]+A[2][2])-(A[0][0]+A[1][2]+A[2][1]);
	ll ig=(A[0][2]+A[1][1]+A[2][0])-(A[0][0]+A[1][2]+A[2][1]);
	
	if (ba%3 || ca%3 || ed%3 || fd%3 || hg%3 || ig%3){
		cout << 0 << "\n";
		return 0;	
	}
	
	ba/=3;ca/=3;ed/=3;fd/=3;hg/=3;ig/=3;
	
	ll adg=n;
	adg-=ba+ca+ed+fd+hg+ig;
	if (adg%3){
		cout << 0 << "\n";
		return 0;
	}
	adg/=3;
	
	vector<ll> va(adg+1);
	for (ll a=0;a<=adg;a++){
		va[a]=getfac(a)*getfac(a+ba)%mod*getfac(a+ca)%mod;
		va[a]=NTT::inv(va[a]);	
	}
	vector<ll> vd(adg+1);
	for (ll d=0;d<=adg;d++){
		vd[d]=getfac(d)*getfac(d+ed)%mod*getfac(d+fd)%mod;
		vd[d]=NTT::inv(vd[d]);	
	}
	vector<ll> vad=NTT::mul(va,vd);
	
	ll ans=0;
	for (ll ad=0;ad<=adg;ad++){
		ll g=adg-ad;
		ll tmp=getfac(g)*getfac(g+hg)%mod*getfac(g+ig)%mod;
		tmp=NTT::inv(tmp);
		ans=(ans+tmp*vad[ad])%mod;
	}
	ans=ans*getfac(n)%mod;
	cout << ans << "\n";
	return 0;	
}