#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
#define LL long long
#define p 998244353
int ksm(int x,int y){
	if(!x)return 1;
	if(x==1)return y;
	LL u=ksm(x/2,y);
	u=u*u%p;
	if(x&1)u=u*y%p;
	return u;
}
int n,a[33],b[33];
int c[33][33];
int det(){
	int sig=1;
	fo(i,1,n){
		fo(j,i+1,n){
			while(c[i][i]){
				int div=c[j][i]/c[i][i];
				fo(k,i,n){
					c[j][k]=(c[j][k]-(LL)c[i][k]*div%p+p)%p;
				}
				swap(c[i],c[j]);
				sig*=(-1);
			}
			swap(c[i],c[j]);
			sig*=(-1);
		}
	}
	LL u=1;
	fo(i,1,n)u=u*c[i][i]%p;
	return (u*sig%p+p)%p;
}
int jc[100011],ny[100011];
void init(){
	jc[0]=ny[0]=1;
	fo(i,1,100000){
		jc[i]=(LL)jc[i-1]*i%p;
		ny[i]=ksm(p-2,jc[i]);
	}
}
int Y[60011];
int cal(int x){
	fo(i,1,n){
		fo(j,1,n){
			LL u=0,v=1;
			fo(k,0,(b[j]-a[i])/2){
				u+=v*ny[k]%p*ny[b[j]-a[i]-2*k]%p;
				v=v*x%p;
			}
			c[i][j]=u%p;
		}
	}
	return det();
}
int Ny(int x){
	return (LL)ny[x]*jc[x-1]%p;
}
int A[60011],B[60011];
int Map[211][211];
int main(){
	scanf("%d",&n);
	fo(i,1,n)scanf("%d",&a[i]);
	fo(i,1,n)scanf("%d",&b[i]),Map[a[i]][b[i]]=1;
	sort(a+1,a+n+1);
	sort(b+1,b+n+1);
	init();
	int len=1;
	fo(i,1,n)len+=b[i];
	fo(i,1,len){
		Y[i]=cal(i);
		fo(j,1,i-1){
			Y[i]=(LL)Y[i]*Ny(i-j)%p; 
		}
		fo(j,i+1,len){
			Y[i]=(LL)Y[i]*(p-Ny(j-i))%p;
		}
	}
	LL ans=0;
	B[0]=1;
	fo(i,1,len){
		fod(j,i-1,0){
			if(j){
				A[j]=((LL)B[j]*Y[i]%p+(LL)A[j]*(p-i)%p+A[j-1])%p;
			}
			else A[j]=((LL)B[j]*Y[i]%p+(LL)A[j]*(p-i)%p)%p;
		}
		fod(j,i,0){
			if(j){
				B[j]=((LL)B[j]*(p-i)%p+B[j-1])%p;
			}
			else B[j]=(LL)B[j]*(p-i)%p;
		}
	}
	int t=0;
	fo(i,1,n){
		t+=b[i]-a[i];
		if(!Map[a[i]][b[i]]){
			t=1;break;
		}
	}
	if(t&1){
		printf("0");
		return 0;
	}
	t/=2;
	fo(i,0,t){
		if(i&1)ans-=(LL)jc[2*(t-i)]*A[i]%p*ny[t-i]%p;
		else ans+=(LL)jc[2*(t-i)]*A[i]%p*ny[t-i]%p;
	}
	ans=ans%p*jc[t]%p*ksm(t,ksm(p-2,2))%p;
	if(ans<0)ans+=p;
	printf("%lld",ans);
	return 0;
}