#include<bits/stdc++.h>
using namespace std;
const int maxn=1.5e6+5;
#define ll long long
int n;
const ll mod=998244353;
int As,Ap,Ar,Bs,Bp,Br,Cs,Cp,Cr;
ll jc[maxn],inv[maxn];
inline void init(){
	jc[0]=1ll;
	for(ll i=1;i<=n;i++) jc[i]=jc[i-1]*i%mod;
	inv[0]=inv[1]=1ll;
	for(ll i=2;i<=n;i++) inv[i]=(mod-mod/i)*inv[mod%i]%mod;
	for(int i=1;i<=n;i++) inv[i]=inv[i-1]*inv[i]%mod;
}
ll zj[maxn*4],pp[maxn*4],pp2[maxn*4];
inline ll qpow(ll a,ll b){
	ll ret=1ll;
	for( ;b ; b>>=1ll,a=a*a%mod) if(b&1ll) ret=ret*a%mod;
	return ret;
}
const ll g=114514;
inline void NTT(ll *p,int len,ll inv){
	if(len==1) return ;
	ll *e=p;
	ll *o=p+(len>>1);
	for(int i=0;i<len;i++) zj[i]=p[i];
	for(int i=0;i<len;i+=2) e[i>>1]=zj[i],o[i>>1]=zj[i+1];
	NTT(e,len>>1,inv),NTT(o,len>>1,inv);
	ll w0=(inv==g)?pp[len]:pp2[len],wk=1ll;
	for(int i=0;i<(len>>1);i++,wk=wk*w0%mod){
		zj[i]=(e[i]+wk*o[i])%mod;
		zj[i+(len>>1)]=(e[i]-wk*o[i])%mod+mod;
		if(zj[i+(len>>1)]>=mod) zj[i+(len>>1)]-=mod;
	}
	for(int i=0;i<len;i++) p[i]=zj[i];
}
int main(){
	scanf("%d",&n);
	init();
	scanf("%d%d%d",&As,&Ap,&Ar);
	scanf("%d%d%d",&Bs,&Bp,&Br);
	scanf("%d%d%d",&Cs,&Cp,&Cr);
	int y1=As+Bs+Cs-Ap-Bp-Cp;
	int y2=As+Bs+Cs-Ar-Br-Cr;
	int y3=As+Bp+Cr-Ap-Br-Cs;
	int y4=As+Bp+Cr-Ar-Bs-Cp;
	int y5=As+Br+Cp-Ap-Bs-Cr;
	int y6=As+Br+Cp-Ar-Bp-Cs;
	if(y1%3) return puts("0"),0;
	if(y2%3) return puts("0"),0;
	if(y3%3) return puts("0"),0;
	if(y4%3) return puts("0"),0;
	if(y5%3) return puts("0"),0;
	if(y6%3) return puts("0"),0;
	y1/=3,y2/=3,y3/=3,y4/=3,y5/=3,y6/=3;
	y1=-y1,y2=-y2,y3=-y3,y4=-y4,y5=-y5,y6=-y6;
	int len=1;
	ll invv=qpow(g,mod-2);
	while(len<As*2+1) len<<=1,pp[len]=qpow(g,(mod-1)/len),pp2[len]=qpow(invv,(mod-1)/len);
	ll *a=new ll[len];
	ll *b=new ll[len];
	ll *c=new ll[len];
	for(int i=0;i<len;i++) a[i]=b[i]=c[i]=0;
	for(int i=max({0,-y1,-y2});i<=As;i++) a[i]=inv[i]*inv[i+y1]%mod*inv[i+y2]%mod;
	for(int i=max({0,-y3,-y4});i<=As;i++) b[i]=inv[i]*inv[i+y3]%mod*inv[i+y4]%mod;
	for(int i=max({0,-y5,-y6});i<=As;i++) c[i]=inv[i]*inv[i+y5]%mod*inv[i+y6]%mod;
	NTT(a,len,g),NTT(b,len,g);
	for(int i=0;i<len;i++) a[i]=a[i]*b[i]%mod;
	NTT(a,len,invv);
	ll czc=qpow(len,mod-2);
	for(int i=0;i<len;i++) a[i]=a[i]*czc%mod;
	ll ans=0ll;
	for(int i=0;i<=As;i++) ans=(ans+a[i]*c[As-i]%mod)%mod;
	printf("%lld",ans*jc[n]%mod);
	return 0;
}