#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

#define int int64_t

const int MOD = 998244353;
const int G1 = 31;
const int G2 = 128805723;

int pw(int x, int n) {
    int res = 1;
    while (n) {
        if (n % 2 == 0) {
            x = (x * x) % MOD;
            n /= 2;
        } else {
            res = (res * x) % MOD;
            n--;
        }
    }
    return res;
}

void fft(vector<int>& a, bool inv = false) {
    int k = 0;
    while ((1 << k) < (int)a.size()) ++k;
    int n = a.size();
    for (int i = 0; i < n; ++i) {
        int j = 0;
        for (int l = 0; l < k; ++l) {
            if (i & (1 << l)) {
                j |= (1 << (k - l - 1));
            }
        }
        if (i < j) {
            swap(a[i], a[j]);
        }
    }
    for (int l = 1; l < n; l *= 2) {
        int w_n = pw(inv ? G2 : G1, (MOD - 1) / 2 / l);
        for (int i = 0; i < n; i += 2 * l) {
            int w = 1;
            for (int j = 0; j < l; ++j) {
                int x = a[i + j], y = (a[i + j + l] * w) % MOD;
                a[i + j] = (x + y) % MOD;
                a[i + j + l] = (x - y + MOD) % MOD;
                w = (w * w_n) % MOD;
            }
        }
    }
    if (inv) {
        int div = pw(n, MOD - 2);
        for (int i = 0; i < n; ++i) {
            a[i] = (a[i] * div) % MOD;
        }
    }
}

vector<int> operator*(vector<int> a, vector<int> b) {
    int k = 0;
    int sz = a.size() + b.size() - 1;
    while ((1 << k) < sz) ++k;
    a.resize(1 << k);
    b.resize(1 << k);
    fft(a);
    fft(b);
    for (int i = 0; i < (1 << k); ++i) {
        a[i] = (a[i] * b[i]) % MOD;
    }
    fft(a, true);
    a.resize(sz);
    return a;
}

const int MAXN = (1 << 23);
int fact[MAXN], invf[MAXN];

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    fact[0] = 1;
    for (int i = 1; i < MAXN; ++i) {
        fact[i] = (fact[i - 1] * i) % MOD;
    }
    invf[MAXN - 1] = pw(fact[MAXN - 1], MOD - 2);
    for (int i = MAXN - 1; i > 0; --i) {
        invf[i - 1] = (invf[i] * i) % MOD;
    }

    int n;
    cin >> n;
    array<int, 3> a, b, c;
    cin >> a[0] >> a[1] >> a[2];
    cin >> b[0] >> b[1] >> b[2];
    cin >> c[0] >> c[1] >> c[2];
    if ((a[0] + b[0] + c[0] - a[1] - b[1] - c[1]) % 3 != 0) {
        cout << "0\n";
        return 0;
    }
    int d0 = 0;
    int d1 = d0 + (a[1] + b[1] + c[1] - a[0] - b[0] - c[0]) / 3;
    int d2 = d0 + (a[2] + b[2] + c[2] - a[0] - b[0] - c[0]) / 3;
    int mn = min(d0, min(d1, d2));
    d0 -= mn;
    d1 -= mn;
    d2 -= mn;
    int val = 0;
    int e0 = val;
    val = b[0] - d0;
    val = c[2] - d2 - val;
    int e1 = val;
    val = b[1] - d1 - val;
    val = c[0] - d0 - val;
    int e2 = val;
    val = b[2] - d2 - val;
    mn = min(e0, min(e1, e2));
    e0 -= mn;
    e1 -= mn;
    e2 -= mn;
    int f0 = b[0] - d0 - e0;
    int f1 = b[1] - d1 - e1;
    int f2 = b[2] - d2 - e2;
    if (f0 < 0 || f1 < 0 || f2 < 0) {
        cout << "0\n";
        return 0;
    }

    // cerr << d0 << " " << d1 << " " << d2 << endl;
    // cerr << e0 << " " << e1 << " " << e2 << endl;
    // cerr << f0 << " " << f1 << " " << f2 << endl;

    int sz = min(f0, min(f1, f2));
    vector<int> poly_m(sz + 1), poly_n(sz + 1);
    for (int i = 0; i <= sz; ++i) {
        poly_m[i] = (invf[d0 + i] * invf[d1 + i]) % MOD;
        poly_m[i] = (poly_m[i] * invf[d2 + i]) % MOD;

        poly_n[i] = (invf[e0 + i] * invf[e1 + i]) % MOD;
        poly_n[i] = (poly_n[i] * invf[e2 + i]) % MOD;
    }
    auto res = poly_m * poly_n;
    int sum = 0;
    for (int i = 0; i <= sz; ++i) {
        int ans = res[i];
        ans = (ans * invf[f0 - i]) % MOD;
        ans = (ans * invf[f1 - i]) % MOD;
        ans = (ans * invf[f2 - i]) % MOD;
        sum = (sum + ans) % MOD;
    }
    cout << (sum * fact[n]) % MOD << "\n";
    return 0;
}