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

namespace FastIO
{

class FastIOBase
{
 protected:
#ifdef OPENIOBUF
	static const int BUFSIZE=1<<16;
	char buf[BUFSIZE+1];
	int buf_p=0;
#endif
	FILE *target;
	FastIOBase(FILE *f): target(f){}
	~FastIOBase()=default;
 public:
#ifdef OPENIOBUF
	virtual void flush()=0;
#endif
};

class FastOutput final: public FastIOBase
{
 private:
	void __putc(char x)
	{
#ifdef OPENIOBUF
		if(buf[buf_p++]=x,buf_p==BUFSIZE) flush();
#else
		putc(x,target);
#endif
	}
	template<typename T>
	void __write(T x)
	{
		char stk[numeric_limits<T>::digits10+1],*top=stk;
		if(x<0) return __putc('-'),__write(-x);
		do *(top++)=x%10,x/=10; while(x);
		for(;top!=stk;__putc(*(--top)+'0'));
	}
 public:
	FastOutput(FILE *f=stdout): FastIOBase(f) {}
#ifdef OPENIOBUF
	~FastOutput() { flush(); }
	void flush() { fwrite(buf,1,buf_p,target),buf_p=0; }
#endif
	FastOutput &operator <<(char x)
	{ return __putc(x),*this; }
	FastOutput &operator <<(const char *s)
	{ for(;*s;__putc(*(s++)));return *this; }
	FastOutput &operator <<(const std::string &s)
	{ return (*this)<<s.c_str(); }
	template<typename T>
	std::enable_if_t<std::is_integral<T>::value,FastOutput&> operator <<(const T &x)
	{ return __write(x),*this; }
	template<typename ...T>
	void writesp(const T &...x)
	{ std::initializer_list<int>{(this->operator<<(x),__putc(' '),0)...}; }
	template<typename ...T>
	void writeln(const T &...x)
	{ std::initializer_list<int>{(this->operator<<(x),__putc('\n'),0)...}; }
	template<typename Iter>
	void writesp(Iter begin,Iter end)
	{ while(begin!=end) (*this)<<*(begin++)<<' '; }
	template<typename Iter>
	void writeln(Iter begin,Iter end)
	{ while(begin!=end) (*this)<<*(begin++)<<'\n'; }
}qout;

class FastInput final: public FastIOBase
{
 private:
	bool __eof;
 public:
	FastInput(FILE *f=stdin): FastIOBase(f),__eof(false)
#ifdef OPENIOBUF
	{ buf_p=BUFSIZE; }
	void flush() { buf[fread(buf,1,BUFSIZE,target)]=EOF,buf_p=0; }
	bool eof()const { return buf[buf_p]==EOF; }
#else
	{}
	bool eof()const { return feof(target); }
#endif
	char get()
	{
		if(__eof) return EOF;
#ifdef OPENIOBUF
		if(buf_p==BUFSIZE) flush();
		char ch=buf[buf_p++];
#else
		char ch=getc(target);
#endif
		return ~ch?ch:(__eof=true,EOF);
	}
	void unget(char c)
	{
		__eof=false;
#ifdef OPENIOBUF
		buf[--buf_p]=c;
#else
		ungetc(c,target);
#endif
	}
	explicit operator bool()const { return !__eof; }
	FastInput &operator >>(char &x)
	{ while(isspace(x=get()));return *this; }
	template<typename T>
	std::enable_if_t<std::is_integral<T>::value,FastInput&> operator >>(T &x)
	{
		char ch,sym=0;x=0;
		while(isspace(ch=get()));
		if(__eof) return *this;
		if(ch=='-') sym=1,ch=get();
		for(;isdigit(ch);x=(x<<1)+(x<<3)+(ch^48),ch=get());
		return unget(ch),sym?x=-x:x,*this;
	}
	FastInput &operator >>(char *s)
	{
		while(isspace(*s=get()));
		if(__eof) return *this;
		for(;!isspace(*s) && !__eof;*(++s)=get());
		return unget(*s),*s='\0',*this;
	}
	FastInput &operator >>(std::string &s)
	{
		char str_buf[(1<<8)+1]={0},*p=str_buf;
		char *const buf_end=str_buf+(1<<8);
		while(isspace(*p=get()));
		if(__eof) return *this;
		for(s.clear(),p++;;p=str_buf)
		{
			for(;p!=buf_end && !isspace(*p=get()) && !__eof;p++);
			if(p!=buf_end) break;
			s.append(str_buf);
		}
		unget(*p),*p='\0',s.append(str_buf);
		return *this;
	}
	template<typename ...T>
	void read(T &...x)
	{ std::initializer_list<int>{(this->operator>>(x),0)...}; }
	template<typename Iter>
	void read(Iter begin,Iter end)
	{ while(begin!=end) (*this)>>*(begin++); }
}qin;

} // namespace FastIO
using FastIO::qin,FastIO::qout;

using LL=long long;
using LD=long double;
using UI=unsigned int;
using ULL=unsigned long long;

#ifndef DADALZY
#define FILEIO(file) freopen(file".in","r",stdin),freopen(file".out","w",stdout)
#define LOG(...) void()
#else
#define FILEIO(file)
#define LOG(...) fprintf(stderr,__VA_ARGS__)
#endif

namespace Math::ZPoly
{

using LL=long long;
constexpr int MOD=998244353,G=114514,MAXN=1<<21;
inline int qpow(LL a,LL b) { LL r=1;for(;b;(b&1)?r=r*a%MOD:0,a=a*a%MOD,b>>=1);return r; }
inline int madd(int x) { return x; }
inline int mmul(int x) { return x; }
inline int msub(int x,int y) { return (x-=y)<0?x+=MOD:x; }
inline int mdiv(int x,int y) { return (LL)x*qpow(y,MOD-2)%MOD; }
template<typename ...Args> inline int madd(int x,Args ...y) { return (x+=madd(y...))>=MOD?x-=MOD:x; }
template<typename ...Args> inline int mmul(int x,Args ...y) { return (LL)x*mmul(y...)%MOD; }

class PolyTemp
{
 private:
	static PolyTemp V;
	int g[MAXN+5],c1[MAXN+5],c2[MAXN+5];
	PolyTemp()
	{
		int nn=1<<(__lg(MAXN-1)+1);
		for(int i=2;i<=nn;i<<=1)
		{
			g[i>>1]=1;
			int gn=qpow(G,(MOD-1)/i);
			for(int j=(i>>1)+1;j<i;j++) g[j]=mmul(g[j-1],gn);
		}
	}
	friend class Polynomial;
}PolyTemp::V{};

// A class for polynomials in F_{MOD}.
class Polynomial: public vector<int>
{
 private:
	static constexpr int NTT_LIM=100;
	static constexpr auto &g=PolyTemp::V.g,&c1=PolyTemp::V.c1,&c2=PolyTemp::V.c2;
	using BaseT=vector<int>;
#define NTT_CHECK(n,m) (n+m<=NTT_LIM || 1ll*n*m<5ll*(n+m)*__lg(n+m))
#define EXTEND(n) (1<<(__lg((n)-1)+1))
#define MCPY(a,b,s) memcpy(a,b,(s)*sizeof(int))
#define MSET(a,b,s) memset(a,b,(s)*sizeof(int))
 public:
	static void DIT(int *a,int len)
	{
		for(int i=len>>1;i;i>>=1)
			for(int j=0;j<len;j+=i<<1)
				for(int k=0,x,y;k<i;k++)
					x=a[j+k],y=a[i+j+k],a[j+k]=madd(x,y),a[i+j+k]=mmul(g[i+k],msub(x,y));
	}
	static void DIF(int *a,int len)
	{
		for(int i=1;i<len;i<<=1)
			for(int j=0;j<len;j+=i<<1)
				for(int k=0,x,y;k<i;k++)
					x=a[j+k],y=mmul(g[i+k],a[i+j+k]),a[j+k]=madd(x,y),a[i+j+k]=msub(x,y);
		int x=qpow(len,MOD-2);
		for(int i=0;i<len;i++) a[i]=mmul(a[i],x);
		reverse(a+1,a+len);
	}
 private:
	static void __polyinv(const int *a,int *b,int len)
	{
		if(len==1) return b[0]=qpow(a[0],MOD-2),void();
		__polyinv(a,b,(len+1)>>1);
		int nn=EXTEND(len<<1);
		MCPY(c1,a,len);
		MSET(b+len,0,nn-len);
		MSET(c1+len,0,nn-len);
		DIT(b,nn),DIT(c1,nn);
		for(int i=0;i<nn;i++) b[i]=mmul(b[i],msub(2,mmul(b[i],c1[i])));
		DIF(b,nn),MSET(b+len,0,nn-len);
	}
	static void __polyln(const int *a,int *b,int len)
	{
		__polyinv(a,b,len);
		for(int i=1;i<len;i++) c1[i-1]=mmul(i,a[i]);
		int nn=EXTEND(len<<1);
		MSET(b+len,0,nn-len);
		MSET(c1+len,0,nn-len);
		DIT(b,nn),DIT(c1,nn);
		for(int i=0;i<nn;i++) b[i]=mmul(b[i],c1[i]);
		DIF(b,nn),MSET(b+len,0,nn-len);
		for(int i=len-1;i>0;i--) b[i]=mdiv(b[i-1],i);
		b[0]=0;
	}
	static void __polyexp(const int *a,int *b,int l,int r)
	{
		if(l==r-1) return b[l]=(l?mdiv(b[l],l):1),void();
		int len=r-l,mid=(l+r)>>1;
		__polyexp(a,b,l,mid);
		for(int i=0;i<len;i++) c1[i]=a[i];
		MCPY(c2,b+l,mid-l);
		MSET(c2+mid-l,0,r-mid);
		if(NTT_CHECK(len,len)) for(int i=len-1;i>=0;i--)
		{
			int tmp=0;
			for(int j=0;j<=i;j++)
				tmp=madd(tmp,mmul(c1[j],c2[i-j]));
			c1[i]=tmp;
		}
		else
		{
			DIT(c1,len),DIT(c2,len);
			for(int i=0;i<len;i++) c1[i]=mmul(c1[i],c2[i]);
			DIF(c1,len);
		}
		for(int i=mid;i<r;i++) b[i]=madd(b[i],c1[i-l]);
		__polyexp(a,b,mid,r);
	}
 public:
	using BaseT::BaseT;
	using BaseT::operator=;
	int operator ()(int x)const
	{
		int res=0,sz=size();
		for(int i=sz-1;i>=0;i--)
			res=madd(mmul(res,x),(*this)[i]);
		return res;
	}
#define DEF_OP(op) \
	Polynomial operator op(const Polynomial &p)const \
	{ return Polynomial(*this)op##=p; } \
	Polynomial &operator op##=(const Polynomial &p)
	DEF_OP(+)
	{
		int n=size(),m=p.size();
		if(n<m) resize(m);
		for(int i=0;i<m;i++)
			(*this)[i]=madd((*this)[i],p[i]);
		return *this;
	}
	DEF_OP(-)
	{
		int n=size(),m=p.size();
		if(n<m) resize(m);
		for(int i=0;i<m;i++)
			(*this)[i]=msub((*this)[i],p[i]);
		return *this;
	}
	DEF_OP(*)
	{
		int n=size(),m=p.size(),sz=n+m-1;
		if(!n || !m) return clear(),*this;
		resize(sz);
		if(NTT_CHECK(n,m))
		{
			MCPY(c1,data(),n);
			MSET(c2,0,sz);
			for(int i=0;i<n;i++)
				for(int j=0;j<m;j++)
					c2[i+j]=madd(c2[i+j],mmul(c1[i],p[j]));
			MCPY(data(),c2,sz);
		}
		else if(this==addressof(p))
		{
			int nn=EXTEND(sz);
			MCPY(c1,data(),n);
			MSET(c1+n,0,nn-n);
			DIT(c1,nn);
			for(int i=0;i<nn;i++) c1[i]=mmul(c1[i],c1[i]);
			DIF(c1,nn);
			MCPY(data(),c1,sz);
		}
		else
		{
			int nn=EXTEND(sz);
			MCPY(c1,data(),n),MCPY(c2,p.data(),m);
			MSET(c1+n,0,nn-n),MSET(c2+m,0,nn-m);
			DIT(c1,nn),DIT(c2,nn);
			for(int i=0;i<nn;i++) c1[i]=mmul(c1[i],c2[i]);
			DIF(c1,nn);
			MCPY(data(),c1,sz);
		}
		return *this;
	}
	DEF_OP(/) { return (*this)*=p.inv(); }
	DEF_OP(%) { return (*this)=divr(*this,p).second; }
#undef DEF_OP
	Polynomial &operator *=(int k)
	{ for(auto &i: *this) i=mmul(i,k); return *this; }
	friend Polynomial operator *(const Polynomial &p,int k)
	{ return Polynomial(p)*=k; }
	friend Polynomial operator *(int k,const Polynomial &p)
	{ return Polynomial(p)*=k; }
	friend Polynomial derivative(const Polynomial &p)
	{
		int sz=p.size();
		Polynomial q(sz-1);
		for(int i=1;i<sz;i++) q[i-1]=mmul(p[i],i);
		return q;
	}
	friend Polynomial integral(const Polynomial &p)
	{
		int sz=p.size();
		Polynomial q(sz+1);
		for(int i=1;i<sz;i++) q[i+1]=mdiv(p[i],i+1);
		return q;
	}
	Polynomial inv()const
	{
		if(empty() || front()==0) throw runtime_error("[x^0]f(x)=0, f(x)^-1 doesn't exist.\n");
		int sz=size(),nn=1<<(__lg((sz<<1)-1)+1);
		Polynomial q(nn);
		__polyinv(data(),q.data(),sz);
		return q.resize(sz),q;
	}
	friend Polynomial ln(const Polynomial &p)
	{
		if(p.empty() || p[0]!=1) throw runtime_error("[x^0]f(x)!=1, ln(f(x)) doesn't exist.\n");
		int sz=p.size(),nn=1<<(__lg((sz<<1)-1)+1);
		Polynomial q(nn);
		__polyln(p.data(),q.data(),sz);
		return q.resize(sz),q;
	}
	friend Polynomial exp(const Polynomial &p)
	{
		if(p.empty()) return Polynomial{1};
		if(p[0]!=0) throw runtime_error("[x^0]f(x)!=0, exp(f(x)) doesn't exist.\n");
		static int c[MAXN];
		int sz=p.size(),nn=1<<(__lg(sz-1)+1);
		for(int i=0;i<sz;i++) c[i]=mmul(i,p[i]);
		Polynomial q(nn);
		__polyexp(c,q.data(),0,nn);
		return q.resize(sz),q;
	}
	friend pair<Polynomial,Polynomial> divr(const Polynomial &f,const Polynomial &g)
	{
		if(f.size()<g.size()) return make_pair(Polynomial{0},f);
		int n=f.size()-1,m=g.size()-1;
		Polynomial fr(n+1),gr(m+1);
		for(int i=0;i<=n;i++) fr[i]=f[n-i];
		for(int i=0;i<=m;i++) gr[i]=g[m-i];
		fr.resize(n-m+1),gr.resize(n-m+1),fr*=gr.inv();
		fr.resize(n-m+1),reverse(fr.begin(),fr.end());
		gr=f-fr*g,gr.resize(m);
		return make_pair(fr,gr);
	}
#undef NTT_CHECK
#undef EXTEND
#undef MCPY
#undef MSET
};

} // namespace ZPoly
using namespace Math::ZPoly;

constexpr int LIM=3e6;
int n,Ar,Ap,As,Br,Bp,Bs,Cr,Cp,Cs;
int fac[3000005],inv[3000005];

int main()
{
	qin>>n;
	qin>>Ar>>Ap>>As;
	qin>>Br>>Bp>>Bs;
	qin>>Cr>>Cp>>Cs;
	fac[0]=1;
	for(int i=1;i<=LIM;i++) fac[i]=mmul(fac[i-1],i);
	inv[LIM]=qpow(fac[LIM],MOD-2);
	for(int i=LIM;i>=1;i--) inv[i-1]=mmul(inv[i],i);
	int t1=Ap-Ar,t2=As-Ar,
		t3=Bp-Br,t4=Bs-Br,
		t5=Cp-Cr,t6=Cs-Cr;
	int y1=t1+t3+t5,y2=t2+t4+t6,
		y3=t1-t3+t4-t6,y4=t2-t3+t5-t6,
		y5=t1-t4-t5+t6,y6=t2+t3-t4-t5;
	if(y1%3 || y2%3 || y3%3 || y4%3 || y5%3 || y6%3)
		return qout<<"0\n",0;
	y1/=3,y2/=3,y3/=3,y4/=3,y5/=3,y6/=3;
	int C=n-(y1+y2+y3+y4+y5+y6),ans=0;
	if(C<0 || C%3!=0)
		return qout<<"0\n",0;
	C/=3;
	Polynomial F1(C+1),F2(C+1);
	for(int i=max({0,-y1,-y2});i<=C;i++)
		F1[i]=mmul(inv[i],inv[i+y1],inv[i+y2]);
	for(int i=max({0,-y3,-y4});i<=C;i++)
		F2[i]=mmul(inv[i],inv[i+y3],inv[i+y4]);
	F1*=F2;
	for(int i=max({0,-y5,-y6});i<=C;i++)
		ans=madd(ans,mmul(F1[C-i],inv[i],inv[i+y5],inv[i+y6]));
	qout<<mmul(fac[n],ans)<<'\n';
	return 0;
}