// Problem: #3627. 「2021 集训队互测」这是一道集训队胡策题
// Contest: LibreOJ
// URL: https://loj.ac/p/3627
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Author: nullptr_qwq
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define fi first
#define se second
#define inf 1e9
#define pii pair<int,int>
#define F(i,a,b) for(int i=a;i<=(b);i++)
#define dF(i,a,b) for(int i=a;i>=(b);i--)
#define wh(lzm) while(lzm--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) (x&(-x))
#define HH printf("\n")
#define eb emplace_back
using namespace std;
int read(){
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return x*f;
}
const int mod=998244353,maxn=5005;
int qpow(int x,int y){
	int rt=1;
	for(;y;y>>=1,x=1ll*x*x%mod) if(y&1) rt=1ll*rt*x%mod;
	return rt;
}
void inc(int &x,int y){ x=(x+y>=mod)?(x+y-mod):(x+y); }
void dec(int &x,int y){ x=(x>=y)?(x-y):(x+mod-y); }
void mul(int &x,int y){ x=1ll*x*y%mod; }
int add(int x,int y){ return (x+y>=mod)?(x+y-mod):(x+y); }
int sub(int x,int y){ return (x>=y)?(x-y):(x+mod-y); }
int prod(int x,int y){ return 1ll*x*y%mod; }
void chkmax(int &x,int y){ x=max(x,y); }
void chkmin(int &x,int y){ x=min(x,y); }
int n,a[maxn][maxn],inv[maxn<<1],fac[maxn<<1],pw[maxn<<1];
int C(int n,int m){ return (m>n||n<0||m<0)?0:1ll*fac[n]*inv[m]%mod*inv[n-m]%mod; }
bitset<maxn>mat[maxn],pre[maxn],suf[maxn];
vector<int>vec[maxn];
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n;
	fac[0]=inv[0]=pw[0]=1;
	int N=n<<1;
	F(i,1,N) fac[i]=1ll*fac[i-1]*i%mod,pw[i]=add(pw[i-1],pw[i-1]);
	inv[N]=qpow(fac[N],mod-2);
	dF(i,N-1,1) inv[i]=1ll*inv[i+1]*(i+1)%mod;
	F(i,1,n) F(j,1,n) {
		char tmp; cin>>tmp;
		a[i][j]=(tmp=='1');
	}
	F(i,1,n) {
		F(j,1,n) if(a[i][j]) mat[i].set(j);
		vec[mat[i].count()].push_back(i);
	}
    F(i,1,n){ pre[i]=pre[i-1]; for(int j:vec[i]) pre[i]|=mat[j]; }
    F(i,1,n) suf[n+1].set(i);
    dF(i,n,1){ suf[i]=suf[i+1]; for(int j:vec[i]) suf[i]&=mat[j]; }
    int ans=0;
    F(i,0,n) if((pre[i]|suf[i])==suf[i]){
    	inc(ans,pw[(int)vec[i].size()]-1);
    	inc(ans,C(suf[i].count()-pre[i].count(),i-pre[i].count()));
    }
    cout<<ans;
}