#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i ++)
#define dep(i, a, b) for (int i = (a); i >= (b); i --)
using namespace std;

char buf[1 << 23], *p1 = buf, *p2 = buf;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1 ++)
int read() {
	int s(0), f(1); char ch(getchar());
	while (!isdigit(ch)) f = ch == '-' ? -1 : 1, ch = getchar();
	while (isdigit(ch)) s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
	return s * f;
}

const double eps = 1e-6;
const int mod = 998244353, rt = 3, invg = 332748118;
const int N = 3e7 + 5;

int n, fac[N], inv[N], y[7], f[N], g[N], h[N];
int rev[N], len, bit;

double a[7][8] = {
    0, 0, 0, 0, 0, 0, 0, 0,
    0, 1, 0, 1, 0, 1, 0, 0,
    0, 0, 1, 0, 1, 0, 1, 0,
    0, 1, 0, 0,-1,-1, 1, 0,
    0, 0, 1, 1,-1,-1, 0, 0,
    0, 1, 0,-1, 1, 0,-1, 0,
    0, 0, 1,-1, 0, 1,-1, 0
};

template <typename A> int mul(A x) {return x; }
template <typename A, typename ...B> int mul(A x, B ...args) { return 1ll * x * mul(args ...) % mod; }

int ksm(int a, int b) { 
	int res = 1;
	while(b > 0) {
		if(b & 1) res = mul(res, a);
		a = mul(a, a), b >>= 1;
	}
	return res;
}

void ntt(int *f, int op) {
	for(int i = 0; i < len; ++ i)
		if(i < rev[i]) swap(f[i], f[rev[i]]);
	for(int i = 2; i <= len; i <<= 1) {
		int base = ksm(op == 1 ? rt : invg, (mod - 1) / i);
		for(int j = 0, p = i >> 1; j < len; j += i)
			for(int k = 0, pw = 1; k < p; ++ k, pw = mul(pw, base)) {
				int x = f[j + k], y = mul(pw, f[j + k + p]);
				f[j + k] = (x + y) % mod;
				f[j + k + p] = (x - y + mod) % mod;
			}
	}
	if(op == -1)
		for(int i = 0, iv = ksm(len, mod - 2); i < len; ++ i)
			f[i] = mul(f[i], iv);
}

void work(int* f, int* g) {
	ntt(f, 1), ntt(g, 1);
	rep(i, 0, len - 1) f[i] = mul(f[i], g[i]);
	ntt(f, -1);
}

int main() {
	n = read();
	int AR = read(), AP = read(), AS = read();
	int BR = read(), BP = read(), BS = read();
	int CR = read(), CP = read(), CS = read();
	a[1][7] = AP - AR, a[2][7] = AS - AR;
	a[3][7] = BP - BR, a[4][7] = BS - BR;
	a[5][7] = CP - CR, a[6][7] = CS - CR;
	rep(i, 1, 6) {
		int p = i;
		rep(j, i + 1, 6) if (fabs(a[j][i]) > fabs(a[p][i])) p = j;
		rep(j, i, 7) swap(a[i][j], a[p][j]);
		if (fabs(a[i][i]) < eps) return puts("0"), 0;
		rep(j, 1, 6) if (i ^ j) {
			double rate = a[j][i] / a[i][i];
			rep(k, i, 7) a[j][k] -= a[i][k] * rate;
		}
	}
	int s = 0;
	rep(i, 1, 6) {
		double cur = a[i][7] / a[i][i];
		if (fabs(cur - (int)cur) > eps) return puts("0"), 0;
		y[i] = (int)cur, s += y[i];
	}
	fac[0] = 1;
	rep(i, 1, n) fac[i] = mul(fac[i - 1], i);
	inv[n] = ksm(fac[n], mod - 2);
	dep(i, n - 1, 0) inv[i] = mul(inv[i + 1], i + 1);
	rep(i, max({0, -y[1], -y[2]}), AR)
		f[i] = mul(inv[i], inv[i + y[1]], inv[i + y[2]]);
	rep(i, max({0, -y[3], -y[4]}), AR)
		g[i] = mul(inv[i], inv[i + y[3]], inv[i + y[4]]);
	rep(i, max({0, -y[5], -y[6]}), AR)
		h[i] = mul(inv[i], inv[i + y[5]], inv[i + y[6]]);
	len = 1, bit = 0;
	while (len <= (AR << 1)) len <<= 1, ++ bit;
	rep(i, 1, len - 1) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (bit - 1));
	work(f, g), work(f, h);
	printf("%d\n", mul(fac[n], f[AR]));
	return 0;
}