#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 5001
#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 MD(int x)
{
	return x>=mod?x-mod:x;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
int n,res,ans,C[N+1][N+1],c[N+1][N+1],cnt[N+1],p[N+1],A[N+1][N+1],B[N+1][N+1];
bool cmp(int x,int y)
{
	return cnt[x]<cnt[y];
}
int main()
{
	int ps=0,cnt1,cnt2;
	bool op;
	char cs;
	for (int i=0;i<=N;++i) C[i][0]=1;
	for (int i=1;i<=N;++i)
		for (int j=1;j<=i;++j)
			C[i][j]=MD(C[i-1][j-1]+C[i-1][j]);
	n=read();
	for (int i=1;i<=n;++i)
	{
		p[i]=i;
		for (int j=1;j<=n;++j) cin>>cs,c[i][j]=cs-'0',cnt[i]+=(!c[i][j]);
	}
	sort(p+1,p+n+1,cmp);
	for (int i=0;i<=n;++i)
	{
		if (i)
		{
			for (int j=0;j<=n;++j) A[i][j]=A[i-1][j];
		}
		while (ps+1<=n&&cnt[p[ps+1]]<=i)
		{
			++ps;
			for (int j=1;j<=n;++j) A[i][j]|=(!c[p[ps]][j]);
		}
	}
	ps=n+1;
	for (int i=1;i<=n;++i) B[n+1][i]=1;
	for (int i=n;i>=0;--i)
	{
		for (int j=0;j<=n;++j) B[i][j]=B[i+1][j];
		while (ps-1>=1&&cnt[p[ps-1]]>=i)
		{
			--ps;
			for (int j=1;j<=n;++j) B[i][j]&=(!c[p[ps]][j]);
		}
	}
	for (int i=0;i<=n;++i)
	{
		op=1;
		for (int j=1;j<=n;++j) op&=(A[i][j]<=B[i][j]);
		if (op)
		{
			res=1,cnt1=cnt2=0;
			for (int j=1;j<=n;++j)
			{
				if (A[i][j]&&B[i][j]) cnt1++;
				if (!A[i][j]&&B[i][j]) cnt2++;
			}
			for (int j=1;j<=n;++j)
				if (cnt[j]==i)
					res=2ll*res%mod;
			if (i>=cnt1) Adder(ans,1ll*res*C[cnt2][i-cnt1]%mod);
		}
	}
	printf("%d\n",ans);
	return 0;
}