#include<bits/stdc++.h>
using namespace std;
const int N=5e3+5,mod=998244353;
int a[N][N],n,p[N],prt[N],num[N],pw2[N];
bitset<N>pre[N],suf[N],ta[N];
int gf(int x){if(x==prt[x])return x;return prt[x]=gf(prt[x]);}
void merge(int x,int y){x=gf(x),y=gf(y);if(x!=y)prt[x]=y,num[y]+=num[x];}
bool eq1[N];
int getc(){char ch=getchar();while(ch!='0' && ch!='1')ch=getchar();return ch-'0';}
bool cmp(int x,int y)
{
	for(int i=1;i<=n;i++)if(a[x][i]>a[y][i])return 1;else if(a[x][i]<a[y][i])return 0;
	return 0;
}
bool eq(int x,int y)
{
	for(int i=1;i<=n;i++)if(a[x][i]!=a[y][i])return 0;
	return 1;
}
int main()
{
	//freopen("de.in","r",stdin);
	//freopen("de.out","w",stdout);
	pw2[0]=1;for(int i=1;i<N;i++)pw2[i]=2*pw2[i-1]%mod;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)a[i][j]=getc();
	for(int i=1;i<=n;i++)p[i]=i,prt[i]=i,num[i]=1;
	//cout<<p[1]<<" "<<p[2]<<" "<<p[3]<<endl;
	sort(p+1,p+n+1,cmp);
	//for(int i=1;i<=n;i++)cout<<p[i]<<" ";cout<<endl;
	for(int i=1;i<n;i++)eq1[i]=eq(p[i],p[i+1]);
	for(int i=1;i<n;i++)if(eq1[i])merge(i,i+1);
	int ans=0;
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)ta[i][j]=a[i][j];
	pre[1]=ta[p[1]];
	for(int i=2;i<=n;i++)pre[i]=pre[i-1]&ta[p[i]];
	suf[n]=ta[p[n]];
	for(int i=n-1;i>=1;i--)suf[i]=suf[i+1]|ta[p[i]];
	ans=(ans+pw2[pre[n].count()])%mod;
	ans=(ans+pw2[n-suf[1].count()])%mod;
	for(int i=1;i<n;i++)if(!eq1[i])
	{
		if((pre[i]&suf[i+1])==suf[i+1])
		{
			//cout<<"?"<<endl;
			int now=(pre[i]^suf[i+1]).count();
			ans=(ans+pw2[now])%mod;
		}
	}
	for(int i=1;i<n;i++)if(eq1[i] && !eq1[i-1])
	{
		//cout<<i<<endl;
		if((pre[i]&suf[i+1])==suf[i+1])
		{
			//cout<<"?"<<endl;
			int now=(pre[i]^suf[i+1]).count();
			//cout<<now<<" "<<pw2[now]<<" "<<pw2[num[gf(i)]]<<endl;
			ans=(ans+1ll*(pw2[num[gf(i)]]-2+mod)*pw2[now])%mod;
		}
	}
	printf("%d\n",ans);
	return 0;
}