#include<iostream>
#include<cstdio>
#include<algorithm>
#define lld long long
using namespace std;
const int N=5e3+5,p=998244353;
lld fac[N],ifac[N];
lld C(int n,int m){return fac[n]*ifac[m]%p*ifac[n-m]%p;}
lld qpow(lld a,int y=p-2){
	lld res=1;
	for(;y;y>>=1,a=a*a%p) if(y&1) res=res*a%p;
	return res;
}
int n,a[N],b[N];
int s1[N],s2[N];
lld t1[N],t2[N]; 
char s[N];
bool cmp(int a,int b){return a>b;}
void solve(int *a,int *s,lld *t){
	sort(a+1,a+n+1,cmp);
	t[0]=1;
	for(int i=1;i<=n;i++) s[0]+=n-a[i];
	for(int i=1,cnt=0,tot=0;i<=n;i++){
		tot+=a[i];
		for(int j=i+1;j<=n;j++) s[i]+=n-a[j];
		s[i]+=tot;
		if(a[i]!=a[i-1]) cnt=0;
		++cnt;
		int j=i;
		while(j<n&&a[j+1]==a[i]) j++;
		t[i]=C(j-i+cnt,cnt);
	}
}
int main(){
	scanf("%d",&n);
	fac[0]=1;
	for(int i=1;i<=n;i++) fac[i]=fac[i-1]*i%p;
	ifac[n]=qpow(fac[n]);
	for(int i=n-1;i>=0;i--) ifac[i]=ifac[i+1]*(i+1)%p;
	for(int i=1;i<=n;i++){
		scanf("%s",s+1);
		for(int j=1;j<=n;j++) a[i]+=s[j]-'0',b[j]+=s[j]-'0';
	}
	solve(a,s1,t1),solve(b,s2,t2);
	int ans=0;
	for(int i=0;i<=n;i++)
	  for(int j=0;j<=n;j++)
	    if(s1[i]+s2[j]-i*j-(n-i)*(n-j)==n*n)
	      ans=(ans+t1[i]*t2[j]%p)%p;
	printf("%d\n",ans);
	return 0;
}