#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define eps 1e-8
#define mod 998244353
ll n,a[3][3],b[7],l[4],jc[1500015],jcinv[1500015];
ll g=3,lim=1,rev[4200042],F[4200042],G[4200042],H[4200042];
db A[11][11];
il bl gauss(){
	fr(i,1,6){
		ll tmp=i;
		fr(j,i+1,6) if(fabs(A[tmp][i])<fabs(A[j][i])) tmp=j;
		swap(A[i],A[tmp]);
		if(fabs(A[i][i])<eps) return 0;
		db tmpp=A[i][i];
		fr(j,i,7) A[i][j]/=tmpp;
		fr(j,i+1,6){
			tmpp=A[j][i];
			fr(k,i,7) A[j][k]-=A[i][k]*tmpp;
		}
	}
	pfr(i,6,1){
		fr(j,1,i-1){
			db tmpp=A[j][i];
			fr(k,i,7) A[j][k]-=A[i][k]*tmpp;
		}
	}
	fr(i,1,6) if(fabs(A[i][7]-round(A[i][7]))>eps) return 0;
	return 1;
}
il void NTT(ll *A,ll t){
	fr(i,0,lim-1) if(i<rev[i]) swap(A[i],A[rev[i]]);
	for(ll i=1;i<lim;i<<=1){
		ll Wn=my_pow(g,(mod-1)/(i<<1),mod);
		for(ll j=0;j<lim;j+=(i<<1)){
			ll w=1;
			fr(k,0,i-1){
				ll tmp1=A[j+k],tmp2=w*A[j+k+i]%mod;
				A[j+k]=(tmp1+tmp2)%mod;
				A[j+k+i]=(tmp1-tmp2+mod)%mod;
				w=w*Wn%mod;
			}
		}
	}
	if(t==-1){
		reverse(A+1,A+lim);
		ll tmp=inv(lim,mod);
		fr(i,0,lim-1) A[i]=A[i]*tmp%mod;
	}
}
int main(){
	n=read();
	fr(i,0,2) fr(j,0,2) a[i][j]=read();
	A[1][1]=A[1][3]=A[1][5]=1;
	A[2][2]=A[2][4]=A[2][6]=1;
	A[3][1]=A[3][6]=1;
	A[3][4]=A[3][5]=-1;
	A[4][2]=A[4][3]=1;
	A[4][4]=A[4][5]=-1;
	A[5][1]=A[5][4]=1;
	A[5][3]=A[5][6]=-1;
	A[6][2]=A[6][5]=1;
	A[6][3]=A[6][6]=-1;
	fr(i,1,6) A[i][7]=a[(i-1)/2][(i-1)%2+1]-a[(i-1)/2][0];
	if(!gauss()){
		write(0);
		return 0;
	}
	ll nn=n;
	jc[0]=1;
	fr(i,1,n) jc[i]=jc[i-1]*i%mod;
	jcinv[n]=inv(jc[n],mod);
	pfr(i,n-1,0) jcinv[i]=jcinv[i+1]*(i+1)%mod;
	fr(i,1,6) b[i]=A[i][7];
	fr(i,1,3) l[i]=max(0ll,max(-b[2*i-1],-b[2*i]));
	fr(i,1,6) n-=b[i];
	if(n<3*(l[1]+l[2]+l[3])||n%3){
		write(0);
		return 0;
	}
	n/=3;
	while(lim<=2*n) lim<<=1;
	fr(i,0,lim-1) rev[i]=(rev[i>>1]>>1)|((i&1)?(lim>>1):0);
	fr(i,l[1],n) F[i]=jcinv[i]*jcinv[i+b[1]]%mod*jcinv[i+b[2]]%mod;
	fr(i,l[2],n) G[i]=jcinv[i]*jcinv[i+b[3]]%mod*jcinv[i+b[4]]%mod;
	fr(i,l[3],n) H[i]=jcinv[i]*jcinv[i+b[5]]%mod*jcinv[i+b[6]]%mod;
	NTT(F,1);
	NTT(G,1);
	NTT(H,1);
	fr(i,0,lim-1) F[i]=F[i]*G[i]%mod*H[i]%mod;
	NTT(F,-1);
	write(F[n]*jc[nn]%mod);
}