#include <bits/stdc++.h>
#define ms(x, v) memset(x, v, sizeof(x))
#define il __attribute__((always_inline)) static
#define U(i,l,r) for(int i(l),END##i(r);i<=END##i;++i)
#define D(i,r,l) for(int i(r),END##i(l);i>=END##i;--i)
using namespace std;
using ll = long long;

#define IC isdigit(c)
#define GC c=getchar()
void rd(auto &x) { x = 0; char GC; bool f = 0;
	for (; !IC; GC) f |= c == '-';
	for (; IC; GC) x = x * 10 + c - 48;
	if (f) x = -x;
}
void rd(auto &x, auto &...y) { rd(x); rd(y...); }
#define meow(...) fprintf(stderr, __VA_ARGS__)
#define Assert(e, v) if (!(e)) { meow("AF@%d\n", __LINE__ ); exit(v); }

#define vc vector
#define eb emplace_back
#define pb push_back

const int N = 3005;
const ll P = 998244353;
il void I(ll &x, ll v) { (x += v) %= P; }
int n; char s[N][N];
ll cv[N][N][2], ch[N][N][2]; // 第 i 列，第 1~j 行填形如一段1一段0（均可空）的方案数

void get_v() {
	U (j, 1, n) {
		auto &f = cv[j];
		f[0][1] = 1;
		U (i, 1, n) {
			if (s[i][j] == '1' || s[i][j] == '?')
				I(f[i][1], f[i - 1][1]);
			if (s[i][j] == '0' || s[i][j] == '?')
				I(f[i][0], f[i - 1][1] + f[i - 1][0]);
		}
	}
}
void get_h() {
	U (i, 1, n) {
		auto &f = ch[i];
		f[0][1] = 1;
		U (j, 1, n) {
			if (s[i][j] == '1' || s[i][j] == '?')
				I(f[j][1], f[j - 1][1]);
			if (s[i][j] == '0' || s[i][j] == '?')
				I(f[j][0], f[j - 1][1] + f[j - 1][0]);
		}
	}
}

ll f[N][N];
int main() {
//	freopen("ava.in", "r", stdin);
	
	rd(n);
	U (i, 1, n) {
		scanf("%s", s[i] + 1);
		s[i][n + 1] = '1';
	}
	U (i, 1, n) s[0][i] = s[i][0] = '1';
	
	get_v();
	get_h();
	U (i, 0, n) cv[n + 1][i][1] = 1;
	
	f[n][n] = 1; // 第 j+1列的状态：若走 11 向上，则确定；
	D (i, n, 1) {
		D (j, n, 0) I(f[i - 1][j], f[i][j] * (ch[i][j][1] + ch[i][j][0]));
		ll h[N] {};
		D (j, n, 1) I(h[j - 1], f[i][j]);
		D (j, n, 0) {
			I(f[i - 1][j], h[j] * ch[i][j][0] %P * cv[j + 1][i][1]); // cv[n+1]:: todo
			if (j)
				I(h[j - 1], h[j] * (cv[j + 1][i][0] + cv[j + 1][i][1]));
		}
	}
	ll ans = 0;
	U (j, 0, n) I(ans, f[0][j]);
	printf("%lld\n", ans);
}