#include<bits/stdc++.h>
#define forup(i,s,e) for(int i=(s),E123=(e);i<=E123;++i)
#define fordown(i,s,e) for(int i=(s),E123=(e);i>=E123;--i)
#define mem(a,b) memset(a,b,sizeof(a))
#ifdef DEBUG
#define msg(args...) fprintf(stderr,args)
#else
#define msg(...) void()
#endif
using namespace std;
using i64=long long;
using pii=pair<int,int>;
#define fi first
#define se second
#define mkp make_pair
#define gc getchar()
int read(){
	int x=0,f=1;char c;
	while(!isdigit(c=gc)) if(c=='-') f=-1;
	while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=gc;}
	return x*f;
}
#undef gc
const int N=5005,inf=0x3f3f3f3f,mod=998244353;
int n,cntx[N],cnty[N],Lcx[N],Rcx[N],Lcy[N],Rcy[N];
int binom[N][N];
char str[N];
bool chk(int X,int Y){
	return cntx[X]+cnty[Y]+((n-X)*n-(cntx[n]-cntx[X]))+((n-Y)*n-(cnty[n]-cnty[Y]))-X*Y-(n-X)*(n-Y)==n*n;
}
int calc(int X,int Y){
	int lx=Lcx[X],rx=Rcx[X];
	int ly=Lcy[Y],ry=Rcy[Y];
	return 1ll*binom[rx-lx+1][X-lx+1]*binom[ry-ly+1][Y-ly+1]%mod;
}
signed main(){
	n=read();
	forup(i,0,n){
		binom[i][0]=1;
		forup(j,1,i){
			binom[i][j]=(binom[i-1][j]+binom[i-1][j-1])%mod;
		}
	}
	forup(i,1,n){
		scanf(" %s",str+1);
		forup(j,1,n){
			if(str[j]=='1'){
				++cntx[i];
				++cnty[j];
			}
		}
	}
	sort(cntx+1,cntx+n+1,greater<int>());
	sort(cnty+1,cnty+n+1,greater<int>());
	forup(i,1,n){
		if(i==1||cntx[i]!=cntx[i-1]){
			Lcx[i]=i;
		}else{
			Lcx[i]=Lcx[i-1];
		}
		if(i==1||cnty[i]!=cnty[i-1]){
			Lcy[i]=i;
		}else{
			Lcy[i]=Lcy[i-1];
		}
	}
	fordown(i,n,1){
		if(i==n||cntx[i]!=cntx[i+1]){
			Rcx[i]=i;
		}else{
			Rcx[i]=Rcx[i+1];
		}
		if(i==n||cnty[i]!=cnty[i+1]){
			Rcy[i]=i;
		}else{
			Rcy[i]=Rcy[i+1];
		}
	}
	forup(i,1,n){
		cntx[i]+=cntx[i-1];
		cnty[i]+=cnty[i-1];
	}
	int ans=0;
	forup(X,0,n){
		forup(Y,0,n){
			if(chk(X,Y)){
				(ans+=calc(X,Y))%=mod;
			}
		}
	}
	printf("%d\n",ans);
}