#include<bits/stdc++.h>
#define ll long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
#define pii pair<int,int>
#define mk make_pair
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int Maxn=5e3+10,mod=998244353;
inline int ksm(int x,int y=mod-2){
    int sum=1;
    while(y){
        if(y&1) sum=1ll*sum*x%mod;
        y=y/2;x=1ll*x*x%mod;
    }return sum;
}
int fac[Maxn],ifac[Maxn];
inline void add(int &x,int y){x+=y;if(x>=mod) x-=mod;}
inline int C(int x,int y){if(x<y || x<0 || y<0) return 0;return 1ll*fac[x]*ifac[y]%mod*ifac[x-y]%mod;}
inline void into(int N){
    fac[0]=ifac[0]=1;
    fr(i,1,N) fac[i]=1ll*fac[i-1]*i%mod;
    ifac[N]=ksm(fac[N]);
    rf(i,N-1,1) ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
}
char c[Maxn][Maxn];
int s1[Maxn],num1[Maxn];
int s2[Maxn],num2[Maxn];
int a1[Maxn],a2[Maxn];
int n;
int v1[Maxn],v2[Maxn];
inline bool cmp(int a,int b){return a>b;}
inline void init(){
    n=read();into(n);
    fr(i,1,n) scanf("%s",c[i]+1);
    fr(i,1,n){
        int now=0;
        fr(j,1,n) now+=(c[i][j]=='1');
        s1[now]++;num1[now]++;a1[i]=now;
    }
    sort(a1+1,a1+n+1,cmp);rf(i,n,1) s1[i]+=s1[i+1];
    fr(j,1,n){
        int now=0;
        fr(i,1,n) now+=(c[i][j]=='1');
        s2[now]++;num2[now]++;a2[j]=now;
    }
    sort(a2+1,a2+n+1,cmp);rf(i,n,1) s2[i]+=s2[i+1];
    fr(i,0,n){
        fr(j,1,n){
            if(j<=i) v1[i]+=a1[j],v2[i]+=a2[j];
            else v1[i]+=n-a1[j],v2[i]+=n-a2[j];
        }
    }
}
inline int getval1(int x){
    if(x==0) return 1;
    if(a1[x]==n) return C(num1[a1[x]],x);
    return C(num1[a1[x]],x-s1[a1[x]+1]);
}
inline int getval2(int x){
    // cout<<"*"<<x<<' '<<a2[x]<<endl;
    if(x==0) return 1;
    if(a2[x]==n) return C(num2[a2[x]],x);
    return C(num2[a2[x]],x-s2[a2[x]+1]);
}
inline void work(){
    int ans=0;
    // fr(i,1,n) cout<<i<<' '<<v1[i]<<' '<<v2[i]<<endl;
    fr(x,0,n) fr(y,0,n){
        int maxn1,maxn2;
        maxn1=v1[x];maxn2=v2[y];
        if(maxn1+maxn2-x*y-(n-x)*(n-y)!=n*n) continue;
        // cout<<x<<' '<<y<<' '<<getval1(x)<<' '<<getval2(y)<<endl;
        add(ans,1ll*getval1(x)*getval2(y)%mod);
    }writeln(ans);
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}