#include <bits/stdc++.h>
using namespace std;
#define ll long long 
#define pb push_back
const ll N = 5005,mod = 998244353;
ll n,ans,a[N][N],h[N],w[N],f[N],g[N],sh[N],sw[N],c[N][N];
ll ph[N],pw[N],nh,nw;
bool check(int x,int y){
	if(sh[x]+(n-x)*n-(sh[n]-sh[x])+sw[y]+(n-y)*n-(sw[n]-sw[y])-x*y-(n-x)*(n-y)!=n*n) return 0;
	return 1;
}
int main(){
	cin.tie(0),cout.tie(0);
	ios::sync_with_stdio(0);
	cin >> n;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			char x;cin >> x;
			a[i][j] = x-'0';
			h[i] += a[i][j],w[j] += a[i][j]; 
		}
	}
	c[0][0] = 1;
	for(int i=1;i<=n;i++){
		c[i][0] = 1;
		for(int j=1;j<=i;j++) c[i][j] = c[i-1][j]+c[i-1][j-1],c[i][j] %= mod;
	}
	sort(h+1,h+1+n),sort(w+1,w+1+n);
	reverse(h+1,h+1+n),reverse(w+1,w+1+n);
	for(int i=1;i<=n;i++) sh[i] = sh[i-1]+h[i],sw[i] = sw[i-1]+w[i];
	h[0] = -1,w[0] = -1;
	for(int i=1;i<=n;i++) if(h[i]!=h[i-1]) ph[++nh] = i;
	for(int i=1;i<=n;i++) if(w[i]!=w[i-1]) pw[++nw] = i;
	ph[++nh] = pw[++nw] = n+1;
	g[0] = f[0] = 1;
	for(int x=1,k=1,l,r;x<=n;x++){
		if(x>=ph[k+1]) k++;
		//x->[ph[k],ph[k+1])
		l = ph[k],r = ph[k+1]-1;
		f[x] = c[r-l+1][x-l+1];
	}
	for(int y=1,k=1,l,r;y<=n;y++){
		if(y>=pw[k+1]) k++;
		l = pw[k],r = pw[k+1]-1;
		g[y] = c[r-l+1][y-l+1];
	}
	for(int x=0;x<=n;x++) for(int y=0;y<=n;y++) if(check(x,y)) ans += f[x]*g[y]%mod,ans %= mod;
	cout << ans;
	return 0;
}