//#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
#define lll __int128
//#define double long double
#define fi first
#define se second
using namespace std;
const long long INF=1e9;
const long long mod=998244353,orm=3;
// const long long mod=1000000007;
const int MAXN=200005;
const double eps=1e-6;
bool ST;
int n;
int a[MAXN],t1[MAXN],t2[MAXN],b[MAXN],c[MAXN],d[MAXN],t3[MAXN],t4[MAXN];
int mp[5005][5005],f[5005][5005],g[5005][5005];
void solve() {
	cin>>n;
    for(int i=1;i<=n;i++) {
        string s;cin>>s;
        for(int j=1;j<=n;j++) {
            mp[i][j]=s[j-1]-'0';
        }
    }
    for(int i=1;i<=n;i++) {
        int ct=0;
        for(int j=1;j<=n;j++) if(mp[i][j]) ct++;
        t1[i]=ct;
    }
    for(int i=1;i<=n;i++) {
        int ct=0;
        for(int j=1;j<=n;j++) if(mp[j][i]) ct++;
        t2[i]=ct;
    }
    for(int i=1;i<=n;i++) t3[i]=t1[i],t4[i]=t2[i];
    for(int i=0;i<=n;i++) {
        for(int j=0;j<=n;j++) f[i][j]=-INF,g[i][j]=0;
    }
    f[0][0]=0,g[0][0]=1;
    for(int i=1;i<=n;i++) {
        for(int j=0;j<=i;j++) {
            if(j>=1) {
                if(f[i][j]<f[i-1][j-1]+t1[i]) {
                    f[i][j]=f[i-1][j-1]+t1[i];
                    g[i][j]=g[i-1][j-1];
                }
                else if(f[i][j]==f[i-1][j-1]+t1[i]) g[i][j]+=g[i-1][j-1],g[i][j]%=mod;
            }
            if(f[i][j]<f[i-1][j]+n-t1[i]) {
                f[i][j]=f[i-1][j]+n-t1[i];
                g[i][j]=g[i-1][j];
            }
            else if(f[i][j]==f[i-1][j]+n-t1[i]) g[i][j]+=g[i-1][j],g[i][j]%=mod;
        }
    }
    for(int i=0;i<=n;i++) a[i]=f[n][i],b[i]=g[n][i];

    for(int i=0;i<=n;i++) {
        for(int j=0;j<=n;j++) f[i][j]=-INF,g[i][j]=0;
    }
    f[0][0]=0,g[0][0]=1;
    for(int i=1;i<=n;i++) {
        for(int j=0;j<=i;j++) {
            if(j>=1) {
                if(f[i][j]<f[i-1][j-1]+t2[i]) {
                    f[i][j]=f[i-1][j-1]+t2[i];
                    g[i][j]=g[i-1][j-1];
                }
                else if(f[i][j]==f[i-1][j-1]+t2[i]) g[i][j]+=g[i-1][j-1],g[i][j]%=mod;
            }
            if(f[i][j]<f[i-1][j]+n-t2[i]) {
                f[i][j]=f[i-1][j]+n-t2[i];
                g[i][j]=g[i-1][j];
            }
            else if(f[i][j]==f[i-1][j]+n-t2[i]) g[i][j]+=g[i-1][j],g[i][j]%=mod;
        }
    }
    for(int i=0;i<=n;i++) c[i]=f[n][i],d[i]=g[n][i];

    int ans=0;
    for(int i=0;i<=n;i++) {
        for(int j=0;j<=n;j++) {
            int nw=a[i]+c[j]-i*j-(n-i)*(n-j);
            if(nw>n*n) assert(0);
            if(nw==n*n) ans+=b[i]*d[j]%mod,ans%=mod;
        }
    }
    cout<<ans;
}
bool ED;
signed main() {
	//  cout<<(&ST-&ED)/1024.0/1024.0;
//	freopen("de.in","r",stdin);
	//freopen("de.out","w",stdout);
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    solve();
	return 0;
}