#include<iostream>
#include<cstdio>
#define N 500
#define mod 998244353
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
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;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
int n,q,cnt,ans,res=1,F[N+1],A[N+1][N+1],B[N+1][N+1],dp[N+1][N+1];
bool op;
void gauss()
{
	int d;
	for (int i=1;i<=n;++i)
	{
		for (int j=i+1;j<=n;++j)
			if (!B[i][i]&&B[i][j])
			{
				for (int k=1;k<=n;++k) swap(A[k][i],A[k][j]),swap(B[k][i],B[k][j]);
				res=MD2(-res);
				break;
			}
		if (!B[i][i])
		{
			cnt++;
			for (int j=1;j<=n;++j) B[i][j]=A[i][j],A[i][j]=0;
			for (int j=1;j<=i-1;++j)
			{
				d=1ll*B[i][j]*fast_pow(B[j][j],mod-2)%mod;
				for (int k=1;k<=n;++k) Adder2(A[i][k],-1ll*A[j][k]*d%mod),Adder2(B[i][k],-1ll*B[j][k]*d%mod);
			}
			for (int j=i+1;j<=n;++j)
				if (!B[i][i]&&B[i][j])
				{
					for (int k=1;k<=n;++k) swap(A[k][i],A[k][j]),swap(B[k][i],B[k][j]);
					res=MD2(-res);
					break;
				}
		}
		if (!B[i][i])
		{
			op=1;
			return;
		}
		for (int j=1;j<=n;++j)
			if (j!=i)
			{
				d=1ll*B[j][i]*fast_pow(B[i][i],mod-2)%mod;
				for (int k=1;k<=n;++k) Adder2(A[j][k],-1ll*A[i][k]*d%mod),Adder2(B[j][k],-1ll*B[i][k]*d%mod);
			}
	}
	for (int i=1;i<=n;++i)
	{
		res=1ll*res*B[i][i]%mod,d=fast_pow(B[i][i],mod-2);
		for (int j=1;j<=n;++j) A[i][j]=1ll*A[i][j]*d%mod,B[i][j]=1ll*B[i][j]*d%mod;
	}
	return;
}
void gauss2()
{
	int d;
	for (int i=1;i<=n-1;++i)
	{
		for (int j=i+2;j<=n;++j)
			if (!A[i+1][i]&&A[j][i])
			{
				swap(A[i+1],A[j]);
				for (int k=1;k<=n;++k) swap(A[k][i+1],A[k][j]);
				break;
			}
		if (A[i+1][i])
		{
			for (int j=i+2;j<=n;++j)
			{
				d=1ll*A[j][i]*fast_pow(A[i+1][i],mod-2)%mod;
				for (int k=1;k<=n;++k) Adder2(A[j][k],-1ll*A[i+1][k]*d%mod);
				for (int k=1;k<=n;++k) Adder(A[k][i+1],1ll*A[k][j]*d%mod);
			}
		}
	}
	return;
}
int main()
{
	int rst;
	n=read();
	for (int i=1;i<=n;++i)
		for (int j=1;j<=n;++j)
			A[i][j]=read();
	for (int i=1;i<=n;++i)
		for (int j=1;j<=n;++j)
			B[i][j]=read();
	gauss();
	if (!op)
	{
		gauss2(),dp[0][0]=1;
		for (int i=1;i<=n;++i)
		{
			for (int j=1;j<=i;++j) Adder(dp[i][j],dp[i-1][j-1]);
			rst=1;
			for (int j=i;j>=1;--j)
			{
				if (j!=i) rst=1ll*rst*A[j+1][j]%mod;
				if (!((i-j)&1))
				{
					for (int k=0;k<=i;++k) Adder(dp[i][k],1ll*dp[j-1][k]*A[j][i]%mod*rst%mod);
				}
				else
				{
					for (int k=0;k<=i;++k) Adder2(dp[i][k],-1ll*dp[j-1][k]*A[j][i]%mod*rst%mod);
				}
			}
		}
		for (int i=cnt;i<=n;++i) F[i-cnt]=1ll*dp[n][i]*res%mod;
	}
	for (int i=0;i<=n;++i) printf("%d ",F[i]);
	puts("");
	return 0;
}