#include<bits/stdc++.h>
#define pb push_back
#define ls (g<<1)
#define rs (g<<1|1)
#define md (l+r>>1)
#define Ls l,md,ls
#define Rs md+1,r,rs
#define ll long long
#define rll register ll
#define D long double
#define rd register D
#define eps 1e-10
#define ri register int
#define abs(x) (x)>=0?(x):-(x)
#define fi first
#define se second
#define mp make_pair
#define pii pair<int,int>
#define cr(x) memset(x,0,sizeof(x))
#define fo(i,x,y) for(ri i=x;i<=y;i++)
#define fo2(i,x,y) for(ri i=x;i>=y;i--)
using namespace std;
const int N=5005,p=998244353;
int n,ans,jc[N],ny[N],pw[N];
bitset<N>pre[N],suf[N],bit[N];
vector<int>G[N];char str[N];
inline int C(ri x,ri y){
	if(x<y||y<0)return 0;
	return 1ll*jc[x]*ny[y]%p*ny[x-y]%p;
}
inline int ksm(ri x,ri y){
	ri sm=1;
	for(;y;y>>=1,x=1ll*x*x%p)
	if(y&1)sm=1ll*sm*x%p;
	return sm;
}
int main(){
	scanf("%d",&n);jc[0]=pw[0]=1;
	fo(i,1,n)jc[i]=1ll*jc[i-1]*i%p,pw[i]=2ll*pw[i-1]%p;
	ny[n]=ksm(jc[n],p-2);
	fo2(i,n-1,0)ny[i]=1ll*ny[i+1]*(i+1)%p;
	fo(i,1,n){
		scanf("%s",str+1); 
		fo(j,1,n){
//			ri x;scanf("%1d",&x);
			if(str[j]=='1')bit[i].set(j);
		}
		G[bit[i].count()].pb(i);
	}
	fo(i,1,n){
		pre[i]=pre[i-1];
		for(auto j:G[i])pre[i]|=bit[j];
	}
	fo(i,1,n)suf[n+1].set(i);
	fo2(i,n,1){
		suf[i]=suf[i+1];
		for(auto j:G[i])
			suf[i]&=bit[j];
	}
//	cout<<suf[1]<<endl;
	fo(i,0,n){
		if((pre[i]|suf[i])!=suf[i])continue;
		ri s1=pre[i].count(),s2=suf[i].count();
		if(!G[i].size())(ans+=C(s2-s1,i-s1))%=p;
		else(ans+=pw[G[i].size()])%=p;
	}
	printf("%d",ans);
}