#include <bits/stdc++.h>

using namespace std;

#define lep(i, l, r) for(int i = (l); i <= (r); i ++)
#define rep(i, l, r) for(int i = (l); i >= (r); i --)

const int P = 998244353;

inline int mod(int x) { return x + (x >> 31 & P);}
inline void pls(int &x, int y) { x = mod(x + y - P); }
inline void sub(int &x, int y) { x = mod(x - y); }

int power (int x, int k) {
	int res = 1;
	while (k) {
		if (k & 1) res = 1ll * res * x % P;
		x = 1ll * x * x % P; k >>= 1;
	} return res;
}

using i64 = long long;

const int N = 3000 + 5;

int n;
char s[N][N];
int sol_hang[N][N][2], sol_lie[N][N][2];

void get_lie() {
	lep (j, 1, n) {
		auto &f = sol_lie[j];
		f[0][1] = 1;
		lep (i, 1, n) {
			if (s[i][j] == '1' || s[i][j] == '?')
				pls (f[i][1], f[i - 1][1]);
			if (s[i][j] == '0' || s[i][j] == '?')
				pls (f[i][0], f[i - 1][1]),
				pls (f[i][0], f[i - 1][0]);
		} // 00000011111100000
	}
}

void get_hang() {
	lep (i, 1, n) {
		auto &f = sol_hang[i];
		f[0][1] = 1;
		lep (j, 1, n) {
			if (s[i][j] == '1' || s[i][j] == '?')
				pls (f[j][1], f[j - 1][1]);
			if (s[i][j] == '0' || s[i][j] == '?')
				pls (f[j][0], f[j - 1][1]), 
				pls (f[j][0], f[j - 1][0]);
		}
	}
}

void solve() {
	cin >> n;
	lep (i, 1, n) cin >> (s[i] + 1);
	get_hang();
	get_lie();
	static int dp[N][N];
	dp[n][n] = 1;

	lep (i, 0, n) sol_lie[n + 1][i][1] = 1;

	rep (i, n, 1) {
		rep (j, n, 0) 
			pls (dp[i - 1][j], 1ll * dp[i][j] * (sol_hang[i][j][0] + sol_hang[i][j][1]) % P);
		static int suf[N];
		lep (j, 0, n) suf[j] = 0;
		rep (j, n, 1) suf[j - 1] = dp[i][j];
		rep (j, n, 0) {
			pls (dp[i - 1][j], 1ll * suf[j] * sol_hang[i][j][0] % P * sol_lie[j + 1][i][1] % P);
			if (j) 
				pls (suf[j - 1], 1ll * suf[j] * (sol_lie[j + 1][i][0] + sol_lie[j + 1][i][1]) % P);
		}
	}

	int ans = 0;
	//cerr << dp[0][0] << endl;
	lep (i, 0, n) pls (ans, dp[0][i]);
	cout << ans << '\n';
}

int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int Case = 1;
	//cin >> Case;
	while (Case --) solve();
	return 0;
}