#include<bits/stdc++.h>
#define ll long long
#define rg int
#define ci const int
#define ls x<<1
#define rs x<<1|1
#define mid ((l+r)>>1)
#define ld long double
#define fo(i,l,r) for(int i=(l);i<=(r);++i)
#define fd(i,l,r) for(int i=(l);i>=(r);--i)
#define fu(i,l,r) for(int i=(l);i<(r);++i)
#define gcd __gcd
#define P(x) __builtin_popcountll(x)
using namespace std;
ci N=2e6+5,M=5e3+5,mod=998244353,_g=3,_ig=(mod+1)/3;
ll ksm(ll a,ll b=mod-2)
{
	ll ans=1;
	while(b)
	{
		if(b&1)ans=(ll)ans*a%mod;
		a=(ll)a*a%mod,b>>=1;
	}
	return ans;
}
const ld eps=1e-10;
inline ll read(){ll u,f=1;char o;while((o=getchar())<48||o>57)if(o==45)f=-1;u=(o^48);while((o=getchar())>=48&&o<=57)u=(u<<1)+(u<<3)+(o^48);return u*f;}
void write(ll x){if(x<0)putchar(45),x=-x;if(x>9)write(x/10);putchar(x%10+48);}
mt19937 rad(chrono::steady_clock::now().time_since_epoch().count());
ll n,t[M],fac[M],ifac[M];
struct node
{
	ll w,id;
}b[N];
char ch[M][M];
bitset<5005>a[M],qz[M],hz[M],fu;
bool cmp(node x,node y)
{
	return x.w<y.w;
}
ll C(ll n,ll m)
{
	if(n<m||m<0)return 0;
	return fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}
int main()
{//freopen("1.in","r",stdin);
//	freopen("b.in","r",stdin);
//	freopen("b.out","w",stdout);
	int T=1;
	while(T--)
	{
		n=read();
		fac[0]=1;
		for(rg i=1;i<=n;++i)fac[i]=(ll)fac[i-1]*i%mod;
		ifac[n]=ksm(fac[n],mod-2);
		for(rg i=n;i>=1;--i)ifac[i-1]=(ll)ifac[i]*i%mod;
		fo(i,1,n)
		{
			scanf("%s",ch[i]+1);
		}
		fo(i,1,n)
		{
			b[i].id=i;
			fo(j,1,n)
			{
				ch[i][j]-='0';
				b[i].w+=ch[i][j];
			}
			t[b[i].w]++;
		}
		sort(b+1,b+n+1,cmp);
		fo(i,1,n)fo(j,1,n)a[i][j]=ch[b[i].id][j];
		fo(i,1,n)t[i]+=t[i-1],fu[i]=1;
		fo(i,1,n)qz[i]=qz[i-1]|a[i];
		fd(i,n,1)hz[i]=hz[i+1]|(fu^a[i]);
		ll ans=0;
		fo(i,0,n)
		{
			ll l=t[i-1]+1,r=t[i];
		//	cout<<i<<' '<<l<<' '<<r<<'\n'; 
			if(!(qz[l-1]&hz[r+1]).count())
			{
				if(l<=r)
				{
					bool f=0;
					fo(i,l,r-1)if(a[i]!=a[i+1])
					{
						f=1;
						break;
					}
					if(!f&&(a[l]&qz[l-1])==qz[l-1]&&!(a[l]&hz[r+1]).count())
					{
						ans=(ans+ksm(2,r-l+1))%mod;//cout<<i<<' '<<ans<<'\n';
					}
					
				}
				else
				{
				//	cout<<hz[r+1].count()<<'\n';
					ans=(ans+C(n-qz[l-1].count()-hz[r+1].count(),i-qz[l-1].count()))%mod;
				//	cout<<i<<' '<<ans<<'\n';
				}
			}
		}
		cout<<ans<<'\n';
	}
	return 0;
}