#include<iostream>
#include<cstdio>
#define N 3000
#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;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
int n,ans,l[N+1][N+1],r[N+1][N+1],dp[N+1][N+1],minn[N+1];
char c[N+1][N+1];
int main()
{
	int res;
	n=read();
	for (int i=1;i<=n;++i) minn[i]=n;
	for (int i=1;i<=n;++i)
	{
		l[0][i]=0,r[0][i]=n;
		for (int j=1;j<=n;++j)
		{
			cin>>c[i][j];
			if (c[i][j]=='1') l[i][j]=i;
			else l[i][j]=0;
			if (c[i][j]=='0') minn[i]=min(minn[i],j-1),r[i][j]=i-1;
			else r[i][j]=n;
		}
	}
	for (int i=1;i<=n;++i)
		for (int j=1;j<=n;++j)
			l[i][j]=max(l[i][j],l[i-1][j]),r[i][j]=min(r[i][j],r[i-1][j]);
	dp[0][0]=1;
	for (int i=1;i<=n;++i)
	{
		res=0;
		for (int j=0;j<=n;++j)
		{
			if (j) Adder(res,dp[i-1][j-1]);
			if (j<=minn[i]) Adder(dp[i][j],1ll*res*max(min(r[i-1][j],i-2)-l[i-1][j]+1,0)%mod);
			if (j) res=1ll*res*max(min(r[i-1][j],i-1)-l[i-1][j]+1,0)%mod%mod;
		}
		res=0;
		for (int j=0;j<=n;++j)
		{
			if (j&&c[i][j]=='1') res=0;
			res+=(j<=minn[i]),Adder(dp[i][j],1ll*dp[i-1][j]*res%mod);
		}
	}
	for (int i=0;i<=n;++i)
	{
		if (i) ans=1ll*ans*max(r[n][i]-l[n][i]+1,0)%mod;
		Adder(ans,dp[n][i]);
	}
	printf("%d\n",ans);
	return 0;
}