// created:  Mar/28/2024 18:25:55
#pragma GCC target("popcnt")
#include<cstdio>
#include<cctype>
#include<cstring>
#include<type_traits>
#define F(i,l,r) for(int i=(l),i##_end=(r);i<i##_end;++i)
#define I128 //||is_same<T,__int128_t>::value||is_same<T,__uint128_t>::value
using namespace std;
template<typename T>enable_if_t<is_integral<T>::value I128,void> readmain(T &x)
{
	bool neg=false;int c=getchar();
	for(;!isdigit(c);c=getchar())if(c=='-')neg=true;
	for(x=0;isdigit(c);c=getchar())x=(T)(10*x+(c-'0'));
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
typedef unsigned long long ull;
constexpr int N=5085,M=79,MOD=998244353;
int qpow(ull a,int b)
{
	ull c=1;
	for(;b;b>>=1,(a*=a)%=MOD)if(b&1)(c*=a)%=MOD;
	return (int)c;
}
int n,m,n1,d[N],fac[N],invfac[N],l[N],r[N],iv[N],s1[N],s2[N],ans;
char s[N];
ull a[M],b[N][M],c[N][M],p[M];
int main()
{
	read(n);m=(n+63)>>6;n1=n>>6;
	F(i,0,n+1)memset(c[i],0xff,sizeof(ull)*m),d[i]=1;
	F(i,0,n)
	{
		fread(s,1,n+1,stdin);
		memset(a,0,sizeof(ull)*m);
		F(j,0,n1<<3)
		{
			ull x=(((ull*)s)[j]+96)%511;
			x=(x>>1)|(x&1);
			a[j>>3]|=x<<(j<<3&63);
		}
		F(j,n1<<6,n)a[j>>6]|=(ull)(s[j]-'0')<<(j&63);
		int o=0;
		F(j,0,m)o+=__builtin_popcountll(a[j]);
		F(j,0,m)b[o][j]|=a[j];
		F(j,0,m)c[o][j]&=a[j];
		d[o]<<=1;
		(d[o]>=MOD)&&(d[o]-=MOD);
	}
	F(i,fac[0]=1,n+1)fac[i]=(int)((ull)fac[i-1]*i%MOD);
	invfac[n]=qpow(fac[n],MOD-2);
	for(int i=n;i;--i)invfac[i-1]=(int)((ull)invfac[i]*i%MOD);
	F(i,0,n)l[i]=n+1,r[i]=-1;
	F(i,0,n+1)
	{
		F(j,0,m)if(b[i][j]&~p[j])
		{
			for(ull w=b[i][j]&~p[j];w;)
			{
				int z=__builtin_ctzll(w);
				l[j<<6|z]=i;
				w^=1ull<<z;
			}
			p[j]|=b[i][j];
		}
	}
	memset(p,0xff,sizeof(ull)*m);
	for(int i=n;~i;--i)
	{
		F(j,0,m)if(p[j]&~c[i][j])
		{
			for(ull w=p[j]&~c[i][j];w;)
			{
				int z=__builtin_ctzll(w);
				r[j<<6|z]=i;
				w^=1ull<<z;
			}
			p[j]&=c[i][j];
		}
	}
	F(i,0,n)
	{
		++s1[l[i]+1];
		++s2[r[i]+1];
		if(l[i]<r[i])++iv[l[i]+1],--iv[r[i]+1];
	}
	F(i,0,n)s1[i+1]+=s1[i],s2[i+1]+=s2[i],iv[i+1]+=iv[i];
	F(i,0,n+1)if(!iv[i]&&s1[i]<=i&&i<=s2[i])
		ans=(int)((ans+(ull)fac[s2[i]-s1[i]]*invfac[i-s1[i]]%MOD*invfac[s2[i]-i]%MOD*d[i])%MOD);
	printf("%d\n",ans);
	return 0;
}