#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
#define N 305
using namespace std;
int n,p[N],cnt[N],h[N],a[N][N];
int quickPower(int x,int y)
{
    int res=1;
    while (y)
    {
        if (y&1) res=res*x%mod;
        x=x*x%mod;
        y>>=1;
    }
    return res;
}
void BellaKira()
{
    cin>>n;
    for (int i=1;i<=n;i++)
        cin>>p[i];
    for (int i=1;i<=n;i++)
        cin>>h[i];
    for (int i=n;i>=1;i--)
    {
        for (int j=1;j<=n;j++)
        {
            a[i][j]=1;
            if (j+h[i]>=0&&cnt[j+h[i]]==1) a[i][j]=mod-1;
        }
        for (int j=1;j<=n;j++)
            cnt[j]^=(j>=p[i]);
    }
    // for (int i=1;i<=n;i++)
    // {
    //     for (int j=1;j<=n;j++)
    //         cout<<a[i][j]<<" ";
    //     cout<<endl;
    // }
    int ans=1;
    for (int i=1;i<=n;i++)
    {
        if (!a[i][i])
        {
            for (int j=i;j<=n;j++)
                if (a[j][i])
                {
                    swap(a[i],a[j]);
                    ans=(mod-ans)%mod;
                    break;
                }
        }
        if (!a[i][i])
        {
            ans=0;
            break;
        }
        for (int j=i+1;j<=n;j++)
        {
            int coef=a[j][i]*quickPower(a[i][i],mod-2)%mod;
            for (int k=1;k<=n;k++)
                a[j][k]=(a[j][k]-coef*a[i][k]%mod+mod)%mod;
        }
    }
    int tmp=1;
    for (int i=1;i<=n;i++)
        ans=ans*a[i][i]%mod,tmp=tmp*i%mod;
    cout<<((ans+tmp)*((mod+1)/2)%mod)<<'\n';
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}