#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
const int mod=998244353;
const int inf=1e9;
const int iv2=(mod+1)/2;
#define ll long long
#define pc(x) __builtin_popcount(x)
inline int read(){
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+c-'0';c=getchar();}
	return x*f;
}
const int N=305;
int n,m,q[N],h[N],S[N][N],a[N][N],det=1,fac=1;
int dp[1<<20][2];
inline void add(int &x,int y){x=(x+y>=mod?x+y-mod:x+y);}
inline int chk(int x){return min(max(0,x),n);}
inline void solve1(){
	dp[0][0]=1;
	for(int i=0;i<(1<<n);i++){
		//printf("i=%d %d %d\n",i,dp[i][0],dp[i][1]);
		int pos=pc(i)+1;
		for(int j=0;j<n;j++)if(!(i>>j&1)){
			int o=(pc(i>>j)+S[pos+1][chk(j+1+h[pos])])&1;
		//	printf("j=%d o=%d\n",j,o);
			for(int o1=0;o1<2;o1++)
				add(dp[i|(1<<j)][o1^o],dp[i][o1]);
		}
	}printf("%d\n",dp[(1<<n)-1][0]);
	exit(0);
}
inline int ksm(int x,int y){
	int res=1;
	while(y){
		if(y&1)res=1ll*res*x%mod;
		x=1ll*x*x%mod;y>>=1;
	}return res;
}
int main(){
	n=read();
	for(int i=1;i<=n;i++)q[i]=read();
	for(int i=1;i<=n;i++)h[i]=read();
	for(int i=n;i>=1;i--)
		for(int j=1;j<=n;j++)S[i][j]=S[i+1][j]+(j>=q[i]);
//	if(n<=20)solve1();
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			if(S[i+1][chk(j+h[i])]&1)a[i][j]=mod-1;else a[i][j]=1;
	for(int i=1;i<=n;i++){
		int pos=0;
		for(int j=i;j<=n;j++)
			if(a[j][i]){pos=j;break;}
		if(pos^i){
			det=mod-det;
			for(int j=1;j<=n;j++)swap(a[i][j],a[pos][j]);
		}int iv=ksm(a[i][i],mod-2);
		for(int j=1;j<=n;j++){
			if(i==j)continue;
			int kk=1ll*a[j][i]*iv%mod;
			for(int k=1;k<=n;k++)
				a[j][k]=(a[j][k]-1ll*a[i][k]*kk%mod+mod)%mod;
		}
	}for(int i=1;i<=n;i++)
		det=1ll*det*a[i][i]%mod;
	for(int i=1;i<=n;i++)
		fac=1ll*fac*i%mod;
	printf("%d\n",1ll*(det+fac)*iv2%mod);
	return 0;
}