// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\033[33m[" << __LINE__ << "]\033[0m "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T& x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T& x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 35, M = 210, MOD = 998244353, inv2 = (MOD + 1) >> 1;
inline void add(int &x, ll y) {x = (x + y) % MOD;}
int n, a[N], b[N], s, val[M], pw[M], f[N][N], ans, pw2[N * M], ipw2[N * M];
int fac[N * M], ifac[N * M], inv[N * M];
inline int power(int x, int y = MOD - 2) {
	int ans = 1;
	for (; y; x = (ll) x * x % MOD, y >>= 1)
		if (y & 1) ans = (ll) ans * x % MOD;
	return ans;
}
inline void binom(int x) {
	fac[0] = ifac[0] = inv[1] = 1;
	F(i, 2, x) inv[i] = (ll) (MOD - MOD / i) * inv[MOD % i] % MOD;
	F(i, 1, x) fac[i] = (ll) fac[i - 1] * i % MOD, ifac[i] = (ll) ifac[i - 1] * inv[i] % MOD;
}
inline int C(int x, int y) {return x < y || y < 0 ? 0 : (ll) fac[x] * ifac[y] % MOD * ifac[x - y] % MOD;}
struct Lag {
	int n, y[M * N], a[M * N], ans[M * N];
	void mul(int b) { // * (x + b)
		DF(i, n, 0) a[i] = ((i ? a[i - 1] : 0) + (ll) a[i] * b) % MOD;
	}
	void div(int b) { // / (x + b)
		b = power(b);
		F(i, 0, n) a[i] = (ll) (a[i] - (i ? a[i - 1] : 0) + MOD) * b % MOD;
	}
	void solve() {
		ms(a, 0), ms(ans, 0);
		a[0] = 1;
		F(i, 1, n + 1) mul(MOD - i);
		F(i, 1, n + 1) {
			div(MOD - i);
			int coef = 1;
			F(j, 1, n + 1)
				if (i != j) coef = (ll) coef * (i - j + MOD) % MOD;
			coef = (ll) y[i] * power(coef) % MOD;
			F(j, 0, n) add(ans[j], (ll) a[j] * coef);
			mul(MOD - i);
		}
	}
} F;
int det() {
	int ans = 1;
	F(i, 1, n) {
		F(j, i + 1, n)
			if (f[j][i]) {
				ans = MOD - ans;
				swap(f[i], f[j]);
				break;
			}
		if (!f[i][i]) return 0;
		ans = (ll) ans * f[i][i] % MOD;
		int inv = power(f[i][i]);
		F(j, 1, n) if (i != j) {
			int t = (ll) f[j][i] * inv % MOD;
			F(k, i, n) add(f[j][k], MOD - (ll) t * f[i][k] % MOD);
		}
	}
	return ans;
}
void init(int n) {
	pw2[0] = ipw2[0] = 1;
	F(i, 1, n) pw2[i] = 2 * pw2[i - 1] % MOD, ipw2[i] = (ll) inv2 * ipw2[i - 1] % MOD;
}
signed main() {
	binom(200 * 30);
	init(200 * 30);
	read(n);
	F(i, 1, n) read(a[i]);
	F(i, 1, n) {
		read(b[i]), s += b[i] - a[i];
		if (b[i] < a[i]) {
			puts("0");
			return 0;
		}
	}
	if (s & 1) {
		puts("0");
		return 0;
	}
	F(i, 1, n)
		F(j, 1, n)
			if ((a[i] < a[j]) != (b[i] < b[j])) {
				puts("0");
				return 0;
			}
	s /= 2;
	F.n = s;
	F(i, 1, s + 1) {
		pw[0] = 1;
		F(j, 1, 200) pw[j] = (ll) i * pw[j - 1] % MOD;
		F(j, 0, 200) {
			val[j] = 0;
			F(k, 0, j / 2) add(val[j], (ll) pw[k] * ifac[k] % MOD * ifac[j - 2 * k]);
		}
		F(p, 1, n)
			F(q, 1, n)
				if (a[p] <= b[q])
					f[p][q] = val[b[q] - a[p]];
		F.y[i] = det();
		// if (i == 0) debug << (ll) F.y[i] * fac[2 * s] % MOD << endl;
	}
	F.solve();
	F(i, 0, s) {
		int t = (ll) F.ans[i] * fac[s] % MOD * fac[2 * (s - i)] % MOD * ifac[s - i] % MOD;// * ipw2[s - i] % MOD;
		// debug << i << " " << t << " " << s << endl;
		if (i & 1) add(ans, MOD - t);
		else add(ans, t);
	}
	cout << (ll) ans * ipw2[s] % MOD;
	return 0;
}
/* why?
*/