#include<bits/stdc++.h>
#define ci const int
#define ll long long
using namespace std;
ci N=5005,mod=998244353;
int n,sx[N],sy[N],prex[N],prey[N],C[N][N],ans;
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j){
            char c=getchar();
            while(c!='0'&&c!='1')c=getchar();
            if(c=='1')++sx[i],++sy[j];
        }
    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;
    }
    sort(sx+1,sx+n+1),reverse(sx+1,sx+n+1),
    sort(sy+1,sy+n+1),reverse(sy+1,sy+n+1);
    for(int i=1;i<=n;++i)
        prex[i]=prex[i-1]+sx[i],
        prey[i]=prey[i-1]+sy[i];
    for(int x=0;x<=n;++x)
        for(int y=0;y<=n;++y){
            int sum=prex[x]+n*(n-x)-(prex[n]-prex[x])+prey[y]+n*(n-y)-(prey[n]-prey[y])-x*y-(n-x)*(n-y);
            if(sum==n*n){
                int l=x,r=x;
                while(l>1&&sx[l-1]==sx[l])--l;
                while(r<n&&sx[r+1]==sx[r])++r;
                int tmp=C[r-l+1][x-l+1];
                l=y,r=y;
                while(l>1&&sy[l-1]==sy[l])--l;
                while(r<n&&sy[r+1]==sy[r])++r;
                ans=(ans+(ll)tmp*C[r-l+1][y-l+1])%mod;
            }
        }
    printf("%d",ans);
    return 0;
}