#include<bits/stdc++.h>
using namespace std;
const int N = 103, mod = 998244353;
int n, m, num;
int per[N], p[N];
int pos[N], a[N];
int f[N][N];
int fac[N], sm[N];
int C[N][N];
int used[N], pre[N];
int main()
{
	cin >> n;
	fac[0] = 1;
	for (int i = 1; i <= n; ++i)
		fac[i] = 1ll * fac[i - 1] * i % mod;
	for (int i = 1; i <= n; ++i)
		cin >> per[i];
	for (int i = 1; i <= n; ++i)
		cin >> p[per[i]];
	for (int i = 1; i <= n; ++i)
		if (p[i])
			pos[++m] = i, used[a[m] = p[i]] = 1;
	for (int i = 1; i <= n; ++i)
	{
		pre[i] = pre[i - 1];
		if (!used[i])
			++pre[i];
	}
	pos[++m] = n + 1;
	a[m] = n + 1;
	f[0][0] = 1;
	for (int i = 0; i <= n; ++i)
	{
		C[i][0] = 1;
		for (int j = 1; j <= i; ++j)
			C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
	}
	for (int i = 1; i <= m; ++i)
		for (int j = 0; j < i; ++j)
			if (a[j] < a[i])
			{
				for (int k = 0; k <= sm[j]; ++k)
				{
					int dis = pos[i] - pos[j] - (i - j);
					int vdis = pre[a[i] - 1] - pre[a[j]];
					int lm = min(dis, vdis);
					sm[i] = max(sm[i], sm[j] + lm);
					for (int x = 0; x <= lm; ++x)
						f[i][k + x] = f[i][k + x] + 1ll * C[dis][x] * C[vdis][x] % mod * f[j][k] % mod;
				}
			}
	int res = 0;
	for (int i = 0; i <= pre[n]; ++i)
		res = res + 1ll * f[m][i] * fac[pre[n] - i] % mod;
	cout << res << '\n';
	return 0;
}