#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;

const int N = 35, L = 12, P = 998244353;

int mpow(int x, int k) {
  if (k == 0) return 1;
  int ret = mpow(x * (ull)x % P, k >> 1);
  if (k & 1) ret = ret * (ull)x % P;
  return ret;
}

int norm(int x) { return x >= P ? x - P : x; }
int reduce(int x) { return x < 0 ? x + P : x; }
void add(int& x, int y) {
  if ((x += y - P) < 0) x += P;
}
void sub(int& x, int y) {
  if ((x -= y) < 0) x += P;
}

int root[(1 << L) + 1];
void prep(int l) {
  int n = 1 << L;
  int* w2 = root;
  *w2 = 1;
  w2[1 << l] = mpow(31, 1 << (21 - l));
  for (int i = l; i; --i) w2[1 << (i - 1)] = (ull)w2[1 << i] * w2[1 << i] % P;
  for (int i = 1; i < n; ++i) w2[i] = (ull)w2[i & (i - 1)] * w2[i & -i] % P;
}

void DIF(int *a, int l) {
  int *j, *k, n = 1 << l, len = n >> 1, r, *o;
  for (; len; len >>= 1)
    for (j = a, o = root; j != a + n; j += len << 1, ++o)
      for (k = j; k != j + len; ++k) {
        r = (ull)*o * k[len] % P;
        k[len] = reduce(*k - r);
        add(*k, r);
      }
}

void DIT(int* a, int l) {
  int *j, *k, n = 1 << l, len = 1, r, *o;
  for (; len != n; len <<= 1)
    for (j = a, o = root; j != a + n; j += len << 1, ++o)
      for (k = j; k != j + len; ++k) {
        r = reduce(*k + k[len] - P);
        k[len] = ull(*k - k[len] + P) * *o % P;
        *k = r;
      }
}

void fft(int* a, int lgn, int d = 1) {
  int n = 1 << lgn;
  if (d == 1) DIF(a, lgn);
  else {
    DIT(a, lgn);
    reverse(a + 1, a + n);
    ull nv = P - (P - 1) / n;
    for (int i = 0; i < n; ++i) a[i] = a[i] * nv % P;
  }
}

int n;
int f[N][N][1 << L], mat[N][N];
int fac[2 << L], ifac[2 << L], res[1 << L];
pair<int, int> a[N];

void GG() {
  cout << "0\n";
  exit(0);
}

void init(int M) {
  fac[0] = 1;
  for (int i = 1; i <= M; ++i) fac[i] = fac[i - 1] * (ull)i % P;
  ifac[M] = mpow(fac[M], P - 2);
  for (int i = M; i; --i) ifac[i - 1] = ifac[i] * (ull)i % P;
}

int det() {
  int ret = 1;
  for (int i = 1; i <= n; ++i) {
    int o = -1;
    for (int j = i; j <= n; ++j) if (mat[j][i]) {
      o = j;
      break;
    }
    if (o == -1) return 0;
    if (o != i) {
      ret = P - ret;
      for (int j = i; j <= n; ++j) swap(mat[i][j], mat[o][j]);
    }
    ret = ret * (ull)mat[i][i] % P;
    int nv = mpow(mat[i][i], P - 2);
    for (int j = i; j <= n; ++j) mat[i][j] = mat[i][j] * (ull)nv % P;
    for (int j = i + 1; j <= n; ++j) for (int k = n; k >= i; --k)
      mat[j][k] = (mat[j][k] + (ull)(P - mat[j][i]) * mat[i][k]) % P;
  }
  return ret;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  prep(L);
  init((2 << L) - 1);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i].first;
  for (int i = 1; i <= n; ++i) cin >> a[i].second;
  sort(a + 1, a + n + 1);
  int sum = 0;
  for (int i = 1; i <= n; ++i) {
    sum += a[i].second - a[i].first;
    if (a[i].first > a[i].second) GG();
    if (a[i].second < a[i - 1].second) GG();
  }
  if (sum % 2) GG();
  for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) if (a[i].first <= a[j].second) {
    int t = a[j].second - a[i].first;
    for (int k = 0; k <= t / 2; ++k) f[i][j][k] = ifac[k] * (ull)ifac[t - k * 2] % P;
    fft(f[i][j], L, 1);
  }
  for (int i = 0; i != 1 << L; ++i) {
    for (int j = 1; j <= n; ++j)
      for (int k = 1; k <= n; ++k)
        mat[j][k] = f[j][k][i];
    res[i] = det();
  }
  fft(res, L, -1);
  int ans = 0;
  for (int i = 0; i <= sum / 2; ++i) {
    int v = res[i] * (ull)fac[sum - i * 2] % P * fac[sum / 2] % P * ifac[sum / 2 - i] % P;
    if (i & 1) sub(ans, v);
    else add(ans, v);
  }
  ans = ans * (ull)mpow(2, P - 1 - sum / 2) % P;
  cout << ans << '\n';

  return 0;
}