#include <bits/stdc++.h>
#define For(i,a,b) for(ll i=a;i<=b;i++)
#define qyy cout<<'\n'
using namespace std;
typedef long long ll;
const ll maxn=5e3+3,mod=998244353;
ll n,c[maxn][maxn];
ll qpow(ll a,ll b){
	ll res=1;
	while(b){
		if(b&1) res=res*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return res;
}
ll inv(ll x){
	return qpow(x,mod-2);
}
ll fac[maxn],infac[maxn];
void init(){
	fac[0]=infac[0]=1;
	for(ll i=1;i<maxn;i++){
		fac[i]=fac[i-1]*i%mod;
		infac[i]=inv(fac[i]);
	}
}
ll C(ll a,ll b){
	if(a<0||b<0||a<b) return 0;
	return fac[a]*infac[b]%mod*infac[a-b]%mod;
}
ll s,sa[maxn],sb[maxn];
ll p[maxn],q[maxn];
ll cntp[maxn<<1],cntq[maxn<<1];
ll sp[maxn],sq[maxn];
ll srp[maxn],srq[maxn];
ll f[maxn],g[maxn];
ll ansa[maxn],ansb[maxn],ans;
bool cmp(ll a,ll b){
	return a>b;
}
void slva(){
	for(ll i=1;i<=n;i++){
		p[i]=n-2*sa[i];
		cntp[p[i]+n]++;
	}
	sort(p+1,p+n+1,cmp);
	for(ll i=1;i<=n;i++){
		sp[i]=sp[i-1]+p[i];
	}
	ll cnt=0;
	f[0]=s,ansa[0]=1;
	for(ll i=1;i<=n;i++){
		if(p[i]!=p[i-1]) cnt=0;
		cnt++;
		ansa[i]=C(cntp[p[i]+n],cnt);
		f[i]=s+sp[i];
	}
}
void slvb(){
	for(ll i=1;i<=n;i++){
		q[i]=n-2*sb[i];
		cntq[q[i]+n]++;
	}
	sort(q+1,q+n+1,cmp);
	for(ll i=1;i<=n;i++){
		sq[i]=sq[i-1]+q[i];
	}
	ll cnt=0;
	g[0]=s,ansb[0]=1;
	for(ll i=1;i<=n;i++){
		if(q[i]!=q[i-1]) cnt=0;
		cnt++;
		ansb[i]=C(cntq[q[i]+n],cnt);
		g[i]=s+sq[i];
	}
}
int main(){
	scanf("%lld",&n);
	for(ll i=1;i<=n;i++){
		for(ll j=1;j<=n;j++){
			scanf("%1lld",&c[i][j]);
			sa[i]=sa[i]+c[i][j];
			sb[j]=sb[j]+c[i][j];
			s+=c[i][j];
		}
	}
	init();
	slva();
	slvb();
	for(ll i=0;i<=n;i++){
		for(ll j=0;j<=n;j++){
			if(f[i]+g[j]-i*j-(n-i)*(n-j)==n*n)
				ans+=ansa[i]*ansb[j],ans%=mod;
		}
	}
	cout<<ans<<'\n';
	return 0;
}