#include<iostream>
#include<cstdio>
#define N 300
#define mod 998244353
using namespace std;
int read()
{
    char c=0;
    int sum=0,f=1;
    while (c!='-'&&(c<'0'||c>'9')) c=getchar();
    if (c=='-') c=getchar(),f=-1;
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum*f;
}
int MD(int x)
{
    return x>=mod?x-mod:x;
}
void Adder2(int &x,int d)
{
    x+=d;
    if (x<0) x+=mod;
    return;
}
int fast_pow(int a,int b)
{
    int res=1,mul=a;
    while (b)
    {
	if (b&1) res=1ll*res*mul%mod;
	mul=1ll*mul*mul%mod,b>>=1;
    }
    return res;
}
int n,inv2,h[N+1],q[N+1],G[N+1][N+1];
int gauss()
{
    int d,res=1;
    for (int i=1;i<=n;++i)
    {
	for (int j=1;j<=n;++j)
	    if (!G[i][i]&&G[j][i]&&(j>i||!G[j][j]))
		swap(G[i],G[j]);
	if (G[i][i])
	{
	    for (int j=i;j<=n;++j)
	    {
		d=1ll*G[j][i]*fast_pow(G[i][i],mod-2)%mod;
		for (int k=i;k<=n;++k) Adder2(G[j][k],-1ll*G[i][k]*d%mod);
	    }
	}
    }
    for (int i=1;i<=n;++i) res=1ll*res*G[i][i]%mod;
    return res;
}
int main()
{
    int res=1;
    n=read(),inv2=(mod+1)>>1;
    for (int i=1;i<=n;++i) q[i]=read(),res=1ll*res*i%mod;
    for (int i=1;i<=n;++i) h[i]=read();
    for (int i=1;i<=n;++i)
	for (int j=1;j<=n;++j)
	    G[i][i]=(j+h[i]>=q[i])?mod-1:1;
    printf("%lld\n",1ll*MD(res+gauss())*inv2%mod);
    return 0;
}