#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN=5005;
const int MOD=998244353;
vector<int> edg[MAXN*2],rev[MAXN*2],sc[MAXN*2],sim[MAXN*2];
int dfn[MAXN*2],low[MAXN*2],p[MAXN*2],d[MAXN*2],deg[MAXN*2],tot,n;
int st[MAXN*2],top;bool inq[MAXN*2],vis[MAXN*2],link[MAXN*2][MAXN*2];
int scc[MAXN*2],scnt;
ll ksm(ll a,int b){ll r=1;while(b){if(b&1)r=r*a%MOD;a=a*a%MOD,b>>=1;}return r;}
void tarjan(int u){
	dfn[u]=low[u]=++tot;
	inq[u]=true;st[++top]=u;
	for(int v:edg[u]){
		if(!dfn[v]){
			tarjan(v);
			low[u]=min(low[u],low[v]);
		}else if(inq[v]) low[u]=min(low[u],dfn[v]);
	}
	if(low[u]==dfn[u]){
		scnt++;
		while(st[top+1]!=u){
			scc[st[top]]=scnt;
			sc[scnt].push_back(st[top]);
			inq[st[top--]]=false;
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	// freopen("die.in","r",stdin);
	cin>>n;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			char c;cin>>c;
			if(c=='0') edg[i].push_back(j+n),d[j+n]++;
			else edg[j+n].push_back(i),d[i]++;
		}
	}
	for(int i=1;i<=2*n;i++)
		if(!dfn[i]) tarjan(i);
	for(int u=1;u<=2*n;u++) for(int v:edg[u]) if(scc[u]!=scc[v]){
		sim[scc[u]].push_back(scc[v]);
		deg[scc[v]]++;
	}
	queue<int> q;
	for(int i=1;i<=scnt;i++) if(deg[i]==0) q.push(i);
	ll ans=1;
	while(!q.empty()){
		int s=q.front(),t=0;q.pop();
		for(int u:sc[s]){
			vis[u]=true;
			for(int v:edg[u]) d[v]--;
			t|=(u<=n?1:2);
		}
		if(t==3){
			ans++;
		}else if(t==1){
			int res=0;
			for(int i=1;i<=n;i++) if(!vis[i]&&d[i]==0) res++;
			ans+=ksm(2,res);
		}else{
			int res=0;
			for(int i=n+1;i<=2*n;i++) if(!vis[i]&&d[i]==0) res++;
			ans+=ksm(2,res);
		}
		for(int t:sim[s]){
			if(--deg[t]==0) q.push(t);
		}
	}
	cout<<ans%MOD<<endl;
	return 0;
}