#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN=3005,MOD=998244353;
char s[MAXN][MAXN];
ll f[MAXN],vc[MAXN];
bool okc[MAXN];
signed main() {
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;++i) scanf("%s",s[i]+1),s[i][0]=s[0][i]='1',vc[i]=okc[i]=1;
	f[0]=vc[0]=okc[0]=1;
	for(int i=1;i<=n;++i){
		ll sf=0,vr=0; 
		bool okr=1;
		for(int j=0;j<=n;++j) {
			if(s[i][j]=='0') okr=0;
			else if(s[i][j]=='1') vr=okr;
			else vr+=okr;
			ll w=f[j]*vr%MOD;
			if(okr) w=(w+sf*(vc[j]-okc[j]))%MOD;
			sf=(sf*vc[j]+f[j])%MOD,f[j]=w;
		}
		for(int j=0;j<=n;++j) {
			if(s[i][j]=='0') okc[j]=0;
			else if(s[i][j]=='1') vc[j]=okc[j];
			else vc[j]+=okc[j];
		}
	}
	ll ans=0;
	for(int j=0;j<=n;++j) ans=(ans*vc[j]+f[j])%MOD;
	printf("%lld\n",ans);
	return 0;
}