#include <bits/stdc++.h>
using namespace std;
#define debug(fmt, ...) \
  fprintf(stderr, "[%d] " fmt "\n", __LINE__, ##__VA_ARGS__)
template <class _Tx, class _Ty>
inline void chkmin(_Tx& x, const _Ty& y) { if (y < x) x = y; }
template <class _Tx, class _Ty>
inline void chkmax(_Tx& x, const _Ty& y) { if (x < y) x = y; }
bool Mbe;
using ll = long long;
constexpr int N = 35, M = 205, mod = 998244353, inv2 = (mod + 1) >> 1;
int n, m, lmt, a[N], b[N], fac[N * M], ifac[N * M];
vector<int> f[M];
inline void add(int& x, int y) { x += y, x >= mod && (x -= mod); }
inline void sub(int& x, int y) { x -= y, x < 0 && (x += mod); }
inline int sum(int x, int y) { return x += y, x >= mod ? x - mod : x; }
inline int dif(int x, int y) { return x -= y, x < 0 ? x + mod : x; }
inline int neg(int x) { return x ? mod - x : 0; }
int qpow(int x, int y) {
  int ret = 1;
  for (; y; y >>= 1, x = (ll)x * x % mod)
    if (y & 1) ret = (ll)ret * x % mod;
  return ret;
}
namespace gs {
int a[N][N];
int det(int n) {
  int prd = 1;
  for (int i = 1; i <= n; ++i) {
    int p = i;
    for (int j = i; j <= n; ++j) if (a[j][i]) { p = j; break; }
    if (p != i) {
      prd = neg(prd);
      for (int j = i; j <= n; ++j) swap(a[i][j], a[p][j]);
    }
    if (!a[i][i]) return 0;
    prd = (ll)prd * a[i][i] % mod;
    int inv = qpow(a[i][i], mod - 2);
    for (int j = i; j <= n; ++j) a[i][j] = (ll)a[i][j] * inv % mod;
    for (int j = i + 1; j <= n; ++j) {
      int tmp = a[j][i];
      for (int k = i; k <= n; ++k) sub(a[j][k], (ll)a[i][k] * tmp % mod);
    }
  }
  return prd;
}
} // namespace gs
namespace poly {
constexpr int N = 1 << 14, g = 3;
int pwg[N];
inline int lg2(int x) { return x ? 31 - __builtin_clz(x) : -1; }
inline int getsz(int n) { return n ? 1 << (lg2(n - 1) + 1) : 0; }
void init() {
  for (int h = 2; h <= N; h <<= 1) {
    int gn = qpow(g, (mod - 1) / h);
    pwg[h >> 1] = 1;
    for (int i = (h >> 1) + 1; i < h; ++i) pwg[i] = (ll)pwg[i - 1] * gn % mod;
  }
}
void dft(vector<int>& f) {
  int n = f.size();
  for (int h = n; h >= 2; h >>= 1) {
    for (int i = 0, p = h >> 1; i < n; i += h) {
      for (int j = i; j < i + p; ++j) {
        int u = f[j], v = f[j + p];
        f[j] = sum(u, v), f[j + p] = (ll)pwg[j - i + p] * dif(u, v) % mod;
      }
    }
  }
}
void idft(vector<int>& f) {
  int n = f.size();
  for (int h = 2; h <= n; h <<= 1) {
    for (int i = 0, p = h >> 1; i < n; i += h) {
      for (int j = i; j < i + p; ++j) {
        int t = (ll)pwg[j - i + p] * f[j + p] % mod;
        f[j + p] = dif(f[j], t), add(f[j], t);
      }
    }
  }
  reverse(f.begin() + 1, f.end());
  for (int i = 0, k = qpow(n, mod - 2); i < n; ++i) f[i] = (ll)f[i] * k % mod;
}
struct _ { _() { init(); } } __;
} // namespace poly
bool Med;
int main() {
  // debug("Mem: %.4lfMB.", fabs(&Med - &Mbe) / 1048576);
  cin.tie(0)->sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= n; ++i) cin >> b[i];
  m = *max_element(b + 1, b + n + 1) - *min_element(a + 1, a + n + 1);
  int tot = accumulate(b + 1, b + n + 1, 0) - accumulate(a + 1, a + n + 1, 0);
  if (tot & 1) return cout << "0\n", 0;
  tot >>= 1;
  for (int i = 1; i <= n; ++i) {
    if (a[i] > b[i]) return cout << "0\n", 0;
    for (int j = 1; j <= n; ++j) {
      if ((a[i] > a[j]) != (b[i] > b[j])) {
        return cout << "0\n", 0;
      }
    }
  }
  fac[0] = ifac[0] = ifac[1] = 1;
  for (int i = 1; i < N * M; ++i)
    fac[i] = (ll)fac[i - 1] * i % mod;
  for (int i = 2; i < N * M; ++i)
    ifac[i] = (ll)ifac[mod % i] * (mod - mod / i) % mod;
  for (int i = 2; i < N * M; ++i)
    ifac[i] = (ll)ifac[i - 1] * ifac[i] % mod;
  int lmt = poly::getsz(n * m + 1);
  for (int i = 0; i <= m; ++i) {
    f[i].resize(lmt);
    for (int j = 0; j + j <= i; ++j) {
      f[i][j] = (ll)ifac[j] * ifac[i - j * 2] % mod;
      if (j & 1) f[i][j] = neg(f[i][j]);
    }
    poly::dft(f[i]);
  }
  vector<int> g(lmt);
  for (int x = 0; x < lmt; ++x) {
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= n; ++j) {
        gs::a[i][j] = 0;
        if (a[i] <= b[j]) gs::a[i][j] = f[b[j] - a[i]][x];
      }
    }
    g[x] = gs::det(n);
  }
  poly::idft(g);
  int ans = 0;
  for (int i = 0; i <= tot; ++i)
    ans = (ans + (ll)fac[2 * (tot - i)] * ifac[tot - i] % mod * g[i]) % mod;
  ans = (ll)ans * fac[tot] % mod * qpow(inv2, tot) % mod;
  cout << ans << '\n';
  return 0;
}
/*
g++ -std=c++14 -O2 -o qoj-1262 qoj-1262.cpp -Wall -Wextra
-Wshadow -fsanitize=address,undefined -g
*/