#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
#define templ template<typename T>
templ bool chkmin(T &x,T y){return x>y?x=y,1:0;}
templ bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
typedef long long ll;
#define sz 1500005
const ll mod=998244353;

ll ksm(ll a,ll b,ll ans=1) {
    for (;b;b>>=1,a=a*a%mod) if (b&1) ans=ans*a%mod;
    return ans;
}
ll inv(ll x){return ksm(x,mod-2);}

ll fac[sz],_fac[sz];
void init(){_fac[0]=fac[0]=1;rep(i,1,sz-1) _fac[i]=inv(fac[i]=fac[i-1]*i%mod);}

int n;
int R1,P1,S1,R2,P2,S2,R3,P3,S3;

int rev[sz],wn[sz];
int lim, invlim;
void init(int len) {
    lim = 2 << __lg(len-1);
    invlim = mod - (mod - 1) / lim;
    for (static int i = 1; i < lim; i += i) {
        wn[i] = 1;
        const int w = ksm(3,mod/i/2);
        for (int j = 1; j < i; j ++) {
            wn[i+j] = 1ll*wn[i+j-1]*w%mod;
        }
    }
    for (int i = 1; i < lim; ++i) {
        rev[i] = rev[i >> 1] >> 1 | (i % 2u * lim / 2);
    }
}
void DFT(ll *a) {
    static unsigned long long t[sz];
    for (int i = 0; i < lim; i++) {
        t[i]=a[rev[i]];
    }
    for (int i = 1; i < lim; i += i) {
        for (int j = 0; j < lim; j += i + i) {
            for (int k=0;k<i;++k) {
                const unsigned long long x=t[i+j+k]*wn[i+k]%mod;
                t[i+j+k]=t[k+j]+mod-x,t[k+j]+=x;
            }
        }
    }
    for (int i = 0; i < lim; i++) a[i] = t[i] % mod;
}
void IDFT(ll *a) {
    DFT(a); reverse(a+1,a+lim);
    for (int i = 0; i < lim; i++) a[i]= 1ll * a[i] * invlim % mod;
}

int main() {
    file();
    init();
    cin>>n;
    cin>>R1>>P1>>S1>>R2>>P2>>S2>>R3>>P3>>S3;
    int w1=n-R1-R2-R3;
    int w2=n-S1-S2-S3;
    if ((w1-w2)%3!=0) return puts("0"),0;
    int t1=-w1-w2,t2=(w1-w2)/3;
    if ((t1+t2)%2!=0) return puts("0"),0;
    int P=0,S=(t1+t2)/2,R=(t1-t2)/2;
    int mn=min({P,S,R});
    P-=mn,S-=mn,R-=mn;
    R1-=R,R2-=R,R3-=R;
    S1-=S,S2-=S,S3-=S;
    P1-=P,P2-=P,P3-=P;
    int w4=0;
    int w5=R1-w4;
    int w7=S2-w5;
    int w6=P1-w7;
    int w8=R2-w6;
    int w9=S1-w8;
    int ww=min({w5,w6,w9});
    w5-=ww,w6-=ww,w9-=ww;
    w4+=ww,w7+=ww,w8+=ww;
    if (min({w4,w7,w8})<0) return puts("0"),0;
    int len=min({w4,w7,w8});
    w4-=len,w7-=len,w8-=len;
    static ll a[sz],b[sz];
    rep(i,0,len) a[i]=_fac[w5+i]*_fac[w6+i]%mod*_fac[w9+i]%mod;
    rep(i,0,len) b[i]=_fac[w4+i]*_fac[w7+i]%mod*_fac[w8+i]%mod;
    init(len*2+5);
    DFT(a),DFT(b);
    rep(i,0,lim-1) a[i]=a[i]*b[i]%mod;
    IDFT(a);
    ll ans=0;
    rep(i,0,len) (ans+=_fac[R+i]*_fac[P+i]%mod*_fac[S+i]%mod*a[len-i]%mod)%=mod;
    cout<<ans*fac[n]%mod;
    return 0;
}