#include <iostream>
#include <cstdio>
#include <bitset>
#include <map>
#define mod 998244353
using namespace std;
int n;
int pow_2[5005];
bitset<5005> a[5005];
int cnt[5005];
bitset<5005> pre[5005],suf[5005];
int q[5005],head,tail;
bitset<5005> vis;
map<int,int> book;
int ans;
int main(){
	cin>>n;
	pow_2[0]=1;
	for (int i=1;i<=n;i++)pow_2[i]=2*pow_2[i-1]%mod;
	for (int i=1;i<=n;i++){
		char str[5005];
		scanf("%s",str+1);
		for (int j=1;j<=n;j++)a[i][j]=str[j]-'0',cnt[i]+=str[j]-'0';
	}
	for (int i=1;i<=n;i++){
		int hash_a=0;
		for (int j=1;j<=n;j++)hash_a=(hash_a+a[i][j]*pow_2[j])%1000000009;
	}
	for (int i=1;i<n;i++)
		for (int j=1;j<n;j++)
			if (cnt[j]>cnt[j+1])swap(a[j],a[j+1]),swap(cnt[j],cnt[j+1]);
	pre[1]=a[1],suf[n]=a[n];
	for (int i=2;i<=n;i++)pre[i]=pre[i-1]|a[i];
	for (int i=n-1;i>=1;i--)suf[i]=suf[i+1]&a[i];
	bitset<5005> S;
	head=1,tail=0;
	for (int i=0;i<=n;i++){
		if (i>=1){
			for (int j=1;j<=n;j++)
				if (S[j]==0&&a[i][j]==1)q[++tail]=j;
			S|=a[i];
			vis[i]=1;
			while(head<=tail){
				int p=q[head];
				head++;
				for (int j=1;j<=n;j++){
					if (a[j][p]==0&&vis[j]==0){
						for (int k=1;k<=n;k++)
							if (S[k]==0&&a[j][k]==1)q[++tail]=k;
						S|=a[j];
						vis[j]=1;
					}
				}
			}
		}
		int hash_S=0;
		for (int j=1;j<=n;j++)hash_S=(hash_S+S[j]*pow_2[j])%1000000009;
		if (book[hash_S]==1)continue;
		book[hash_S]=1;
		bitset<5005> X,Y;
		for (int j=1;j<=n;j++)X[j]=0,Y[j]=1;
		int cnt_S=0;
		for (int j=1;j<=n;j++)cnt_S+=S[j];
		int c=0;
		for (int j=1;j<=n;j++)
			if (cnt[j]==cnt_S)c++;
		if (cnt[n]<cnt_S)X=pre[n];
		else{
			for (int j=1;j<=n;j++)
				if (cnt[j]>=cnt_S){
					if (j>1&&cnt[j-1]<cnt_S)X=pre[j-1];
					break;
				}
		}
		if (cnt[1]>cnt_S)Y=suf[1];
		else{
			for (int j=n;j>=1;j--)
				if (cnt[j]<=cnt_S){
					if (j<n&&cnt[j+1]>cnt_S)Y=suf[j+1];
					break;
				}
		}
		int t=0;
		for (int j=1;j<=n;j++)
			if (S[j]==0&&Y[j]==1)t++;
		if (c==0){
			if (X==S)ans=(ans+pow_2[t])%mod;
		}
		else{
			ans=(ans+pow_2[t])%mod;
			ans=(ans+pow_2[c]-2)%mod;
			if (X==S)ans=(ans+1)%mod;
		}
	}
	cout<<ans<<endl;
	return 0;
}