#include<bits/stdc++.h>
#define rep(i,l,r) for (int i(l), i##end(r); i <= i##end; ++i)
#define per(i,r,l) for (int i(r), i##end(l); i >= i##end; --i)
#define ll long long
#define ull unsigned long long
#define fi first
#define se second
#define uint unsigned int
#define eb emplace_back
#define File(filename) freopen(filename".in", "r", stdin), freopen(filename".out", "w", stdout)
using namespace std;
template <typename Tx> inline void read(Tx &x) {x = 0; bool f = 0; char ch = getchar(); while (ch < '0' || ch > '9') f ^= ch == '-', ch = getchar(); while (ch <= '9' && ch >= '0') x = x * 10 + ch - '0', ch = getchar(); if (f) x = -x;}
template <typename Tx, typename ...Ty> inline void read(Tx &x, Ty &...y) {read(x); read(y...);}
template <typename Tx> inline void owrite(Tx x) {if (x > 9) owrite(x / 10); putchar('0' + x % 10);}
template <typename Tx> inline void write(Tx x, char ch = '\n') {owrite(x < 0 ? (putchar('-'), -x) : x); putchar(ch);}
template <typename Tx> inline void cmax(Tx &x, Tx y) {if (x < y) x = y;}
template <typename Tx> inline void cmin(Tx &x, Tx y) {if (x > y) x = y;}
namespace Main {

const int N = 3e3 + 9;
const int mod = 998244353;

int n;
int f[N][N], g[N][N], B[N], C[N][N], R[N][N];
char M[N][N];
bool b0(int i, int j) { return M[i][j] == '?' || M[i][j] == '0';}
bool b1(int i, int j) { return M[i][j] == '?' || M[i][j] == '1';}
void add(int &a, int b) {(a += b) >= mod && (a -= mod);}

void skymaths() {
    read(n);
    rep (i, 1, n) scanf(" %s", M[i] + 1);

    rep (j, 1, n) {
        int x = 0; while (x < n && b1(x + 1, j)) ++x;
        B[j] = x;
    }
    // R : 行
    // C : 列
    rep (i, 1, n) {
        int r = 0;
        rep (l, 0, n) {
            if (l && !b1(i, l)) break;
            cmax(r, l); if (r == l) while (r < n && b0(i, r + 1)) ++r;
            ++R[i][l]; --R[i][r + 1];
        }
        rep (j, 1, n) R[i][j] += R[i][j - 1];
    }
    rep (j, 1, n) {
        int r = 0;
        rep (l, 0, n) {
            if (l && !b1(l, j)) break;
            cmax(r, l); if (r == l) while (r < n && b0(r + 1, j)) ++r;
            ++C[l][j]; --C[r + 1][j];
        }
        rep (i, 1, n) C[i][j] += C[i - 1][j];
    }

    f[0][1] = 1;
    rep (i, 0, n) {
        rep (j, 1, n) {
            if (i == 0 && j == 1) continue;
            f[i][j] = 1ll * f[i][j - 1] * C[i][j] % mod;
            if (i > 0) {
                g[i][j] = 1ll * (g[i - 1][j] + f[i - 1][j]) * R[i][j] % mod;
                if (j > 1 && B[j] >= i && b0(i, j - 1)) add(f[i][j], 1ll * (f[i - 1][j - 1] + g[i - 1][j - 1]) * R[i][j - 2] % mod);
            }
        }
    }

    write((f[n][n] + g[n][n]) % mod);
}

signed main() {
    // freopen("a.in", "r", stdin);
    int T = 1;
    // read(T);
    while (T--) {
        skymaths();
    }
    return 0;
} } signed main() { Main::main(); return 0;}