// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

namespace poly {
	const int M = 1 << 21, mod = 998244353;
	int qp(int n, int m = mod - 2) {
		int res = 1;
		for (; m; m >>= 1) {
			if (m & 1) res = res * n % mod;
			n = n * n % mod;
		}
		return res;
	}
	int len, r[M + 5], w[2][M + 5], L;
 	int sqrt(int n) {return 1;}
 	const int i2 = qp(2);
	int add(int n, int m) {return n + m >= mod ? n + m - mod : n + m;}
	void init(int n) {
		len = 1;
		for(; len < n; len <<= 1);
		w[0][0] = w[1][0] = 1;
		w[0][1] = qp(3, (mod - 1) / len), w[1][1] = qp(w[0][1]);
		rep(i, 1, len - 1) {
			r[i] = (r[i >> 1] >> 1) | (i & 1 ? (len >> 1) : 0);
			w[0][i] = w[0][i - 1] * w[0][1] % mod;
			w[1][i] = w[1][i - 1] * w[1][1] % mod;
		}
	}
	void NTT(vi &f, int o) {
		f.resize(len);
		rep(i, 0, len - 1) if(i > r[i]) swap(f[i], f[r[i]]);
		for(int i = 1, q = len >> 1; i < len; i <<= 1, q >>= 1) {
			for(int j = 0; j < len; j += i << 1) {
				rep(k, 0, i - 1) {
					int tmp = f[j + k + i] * w[o][k * q] % mod;
					f[j + k + i] = add(f[j + k], mod - tmp);
					f[j + k] = add(f[j + k], tmp);
				}
			}
		}
		if(o) {
			const int iv = qp(len);
			rep(i, 0, len - 1) (f[i] *= iv) %= mod;
		}
	}
}
using namespace poly;

const int N = 200;
int a, b, s[N + 5], t[N + 5], g[N + 5][N + 5];

int fac[N * 30 + 5], inv[N * 30 + 5];
void initc() {
	fac[0] = fac[1] = 1;
	rep(i, 2, N * 30) fac[i] = fac[i - 1] * i % mod;
	inv[N * 30] = qp(fac[N * 30]);
	per(i, N * 30 - 1, 0) inv[i] = inv[i + 1] * (i + 1) % mod;
}
int C(int n, int m) {return fac[n] * inv[m] % mod * inv[n - m] % mod;}

int det() {
	int res = 1;
	rep(i, 1, a) {
		rep(j, i, a) if(g[j][i]) {
			swap(g[j], g[i]);
			if(j > i) res = -res;
			break;
		}
		rep(j, 1, a) if(i != j) {
			int tmp = mod - g[j][i] * qp(g[i][i]) % mod;
			rep(k, i, a) (g[j][k] += tmp * g[i][k]) %= mod;
		}
	}
	// rep(i, 1, a) rep(j, 1, a) cout << g[i][j] << " \n"[j == a];
	rep(i, 1, a) (res *= g[i][i]) %= mod;
	return (res + mod) % mod;
}

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	initc();
	cin >> a;
	rep(i, 1, a) cin >> s[i];
	rep(i, 1, a) cin >> t[i], b += t[i] - s[i];
	rep(i, 1, a) rep(j, i + 1, a) if((s[i] < s[j]) != (t[i] < t[j])) return cout << 0, 0;

	if(b & 1) return cout << 0, 0;

	init(max(N, b / 2) + 1);
	vi f[N];
	rep(i, 0, N - 1) {
		f[i].resize(len);
		rep(j, 0, i / 2) f[i][j] = inv[j] * inv[i - j * 2] % mod;
		NTT(f[i], 0);
		// cout << f[i][0] << endl;
	}

	vi res(len);
	rep(i, 0, len - 1) {
		rep(j, 1, a) rep(k, 1, a) {
			if(s[j] <= t[k]) g[j][k] = f[t[k] - s[j]][i];
			else g[j][k] = 0;
		}
		res[i] = det();
	}
	NTT(res, 1);

	// rep(i, 0, len - 1) cout << res[i] << " \n"[i == len - 1];
	// return 0;

	auto sg = [&] (int n) {return n & 1 ? mod - 1 : 1;};
	int ans = 0;
	rep(i, 0, b / 2) {
		(ans += sg(i) * res[i] % mod * fac[b / 2] % mod * fac[b - 2 * i] % mod * inv[b / 2 - i]) %= mod;
	}
	// cout << ans << endl;
	// return 0;
	cout << ans * qp((mod + 1) / 2, b / 2) % mod;
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}