#include<bits/stdc++.h>
using namespace std;
const int N=5005,mod=998244353;char ch[N][N];
int n,h[N],w[N],sh[N],sw[N],sum,ans,iv[N],fac[N],inv[N];
int ksm(int a,int b=mod-2){int s=1;
	for(;b;b>>=1,a=1ll*a*a%mod)if(b&1)s=1ll*s*a%mod;
	return s;
} 
void qm(int &x,int y){x+=y;if(x>=mod)x-=mod;}
int main(){
	fac[0]=inv[0]=iv[0]=1;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%s",ch[i]+1),iv[i]=ksm(i);
	for(int i=1;i<=n;i++)fac[i]=1ll*fac[i-1]*i%mod,inv[i]=1ll*inv[i-1]*iv[i]%mod;
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)h[i]+=ch[i][j]=='1',w[j]+=ch[i][j]=='1';
	for(int i=1;i<=n;i++)sum+=n+n-h[i]-w[i],sh[h[i]]++,sw[w[i]]++;
	sort(h+1,h+n+1),sort(w+1,w+n+1),reverse(h+1,h+n+1),reverse(w+1,w+n+1),h[0]=w[0]=-1;
	int tmp=0,tmp2=0,s1=1,s2=1,p1=0,p2=0;
	for(int x=0;x<=n;x++){s2=1,tmp2=p2=0;
		for(int y=0;y<=n;y++){
			if(tmp+tmp2+sum-(x*y+(n-x)*(n-y))==n*n){
				qm(ans,1ll*s1*s2%mod); 
			}
			if(y<n){tmp2+=2*w[y+1]-n;
				if(w[y+1]!=w[y])s2=1ll*s2*sw[w[y+1]]%mod,p2=1;
				else p2++,s2=1ll*s2*iv[p2]%mod*(sw[w[y]]-(p2-1))%mod;
			}
		}
		if(x<n){tmp+=2*h[x+1]-n;
			if(h[x+1]!=h[x])s1=1ll*s1*sh[h[x+1]]%mod,p1=1;
			else p1++,s1=1ll*s1*iv[p1]%mod*(sh[h[x]]-(p1-1))%mod;
		}
	}
	printf("%d\n",ans);
	return 0;
}