#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int P = 998244353;

const int N = 3e2 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int inc(int a, int b) { return (a += b) >= P ? a - P : a; }
int dec(int a, int b) { return (a -= b) < 0 ? a + P : a; }
int mul(int a, int b) { return 1ll * a * b % P; }
int qpow(int a, int b) { int res = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) res = mul(res, a); return res; }

int n, p[N], h[N], a[N][N], ans, fac = 1;

int det() {
  int res = 1;
  rep(i, 1, n) {
    if (!a[i][i]) {
      rep(j, i + 1, n) if (a[j][i]) {
        swap(a[i], a[j]), res = mul(res, P - 1);
        break;
      }
      if (!a[i][i]) return 0;
    }
    rep(j, i + 1, n) {
      int t = mul(a[j][i], qpow(a[i][i], P - 2));
      rep(k, i, n) a[j][k] = dec(a[j][k], mul(a[i][k], t));
    }
  }
  rep(i, 1, n) res = mul(res, a[i][i]);
  return res;
}

int main() {
  n = read();
  rep(i, 1, n) p[i] = read();
  rep(i, 1, n) h[i] = read();
  rep(i, 1, n) rep(x, 1, n) {
    rep(j, i + 1, n) a[i][j] ^= x + h[i] >= p[j];
  }
  ans = det();
  rep(i, 1, n) fac = mul(fac, i);
  printf("%d\n", mul(inc(ans, fac), (P + 1) / 2));
  return 0;
}