#include<map>
#include<set>
#include<cmath>
#include<ctime>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<string>
#include<bitset>
#include<numeric>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=3e3+10;
const int N=3e3;
const int INF=0x3f3f3f3f;
const long long LINF=0x3f3f3f3f3f3f3f3f;
const int mod=998244353;
int n,ans=0;
char a[MAXN][MAXN];
int pre[MAXN];
bool val[MAXN];
int dp[MAXN];
inline void solve(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%s",a[i]+1);
		a[i][0]='1';
		val[i]=true;
		pre[i]=1;
	}
	dp[0]=1;
	for(int i=1;i<=n;i++)
	{
		int p=1,v=0;
		bool flg=true;
		for(int j=0;j<=n;j++)
		{
			if(a[i][j]=='0'){
				flg=false;
			}
			else if(a[i][j]=='1'){
				p=flg;
			}
			else if(flg){
				p++;
			}
			int tmp=dp[j];
			dp[j]=1ll*dp[j]*p%mod;
			if(flg){
				dp[j]=(dp[j]+1ll*v*(pre[j]-val[j]))%mod;
			}
			v=(1ll*v*pre[j]+tmp)%mod;
			if(a[i][j]=='0'){
				val[j]=false;
			}
			else if(a[i][j]=='1'){
				pre[j]=val[j];
			}
			else if(val[j]){
				pre[j]++;
			}
		}
	}
	for(int i=0;i<=n;i++)
	{
		ans=(1ll*ans*pre[i]+dp[i])%mod;
	}
	printf("%d\n",ans);
}
signed main(){
	#ifdef LOCAL
	freopen("data.in","r",stdin);
	freopen("data.out","w",stdout);
	atexit([](){fprintf(stderr,"%.3lfs\n",(double)clock()/CLOCKS_PER_SEC);});
	#endif
	solve();
	return 0;
}