#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=998244353,N=5010;
int a[N][N],c[N][N];
int b[N],d[N],cb[N],cd[N];
int sb[N],sd[N];
int cmp(int x,int y){
    return x>y;
}
int main() {
    int n;scanf("%d",&n);
    for(int i=0;i<=n;i++){
        c[i][0]=1;
        for(int j=1;j<=i;j++)c[i][j]=(c[i-1][j-1]+c[i-1][j])%mod;
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)scanf("%1d",&a[i][j]),b[i]+=a[i][j],d[j]+=a[i][j];
    }
    sort(b+1,b+1+n,cmp),sort(d+1,d+1+n,cmp);
    for(int i=1;i<=n;i++)cb[b[i]]++,cd[d[i]]++,sb[i]=sb[i-1]+b[i],sd[i]=sd[i-1]+d[i];
    for(int i=n;i>=0;i--)cd[i]+=cd[i+1],cb[i]+=cb[i+1];
    int ans=0;
    b[0]=d[0]=n+2;
    for(int X=0;X<=n;X++)for(int Y=0;Y<=n;Y++){
        int ta=b[X],tb=d[Y];
        if(-(n-X)*(n-Y)-X*Y+sb[X]+sd[Y]+(n-X)*n-(sb[n]-sb[X])+(n-Y)*n-(sd[n]-sd[Y])==n*n){
            ans+=(ll)c[cb[ta]-cb[ta+1]][X-cb[ta+1]]*c[cd[tb]-cd[tb+1]][Y-cd[tb+1]]%mod;
            ans%=mod;
            // cout<<cb[ta]-cb[ta+1]<<" "<<X-cb[ta+1]<<" "<<cd[tb]-cd[tb+1]<<" "<<Y-cd[tb+1]<<"\n";
            // cout<<X<<" "<<Y<<"*\n";
            // cout<<c[cb[ta]-cb[ta+1]][X-cb[ta+1]]<<" "<<c[cd[tb]-cd[tb+1]][Y-cd[tb+1]]<<"\n";
        }
    }
    printf("%d",ans);
    return 0;
}