#include<bits/stdc++.h>
using namespace std;
#define int long long 
const int mod=998244353;
const int N=3e3+5;
int qpow(int a,int x){
	int sum=1;
	while(x){
		if(x&1) sum=sum*a%mod;
		a=a*a%mod;
		x>>=1;
	}return sum;
}
int n;
char a[N][N];
int S0[N][N],S[N][N];
int g[N][N],h[N][N];
int f[N][N],ff[N];
void init(){
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++) S0[i][j]=S0[i][j-1]+S0[i-1][j]-S0[i-1][j-1]+(a[i][j]=='0'),S[i][j]=S[i][j-1]+(a[i][j]=='?');
	}
	for(int i=1;i<=n;i++){
		g[i][0]=1;
		for(int j=1;j<=n;j++){
			g[i][j]=g[i][j-1]*(a[i][j]!='1')+(S0[i][j]-S0[i-1][j]==0);
		}
	}
	for(int j=1;j<=n;j++){
		h[0][j]=1;
		for(int i=1;i<=n;i++) h[i][j]=h[i-1][j]*(a[i][j]!='1')+(S0[i][j]-S0[i][j-1]==0);
	}
}
void solve(){
	for(int i=0;i<=n;i++) f[i][0]=f[0][i]=1;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			f[i][j]+=f[i][j-1]*h[i][j]%mod;
			ff[j]=ff[j]*g[i][j]%mod;
			if(S0[i][j]-S0[i-1][j]==0&&a[i-1][j]!='1'){
				ff[j]+=f[i-1][j-1]*h[i-2][j]%mod;
				ff[j]%=mod;
			}
			f[i][j]+=ff[j];
			f[i][j]%=mod;
		}
	}
	cout<<f[n][n];
}
signed main(){
	cin>>n;
	for(int i=1;i<=n;i++) cin>>(a[i]+1);
	init();
	solve();
	return 0;
}