#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MOD = 998244353;

int n;
int lf[3005][3005], up[3005][3005], lu[3005][3005];
char S[3005][3005];
int dp[3005][3005];

int main() {
    scanf("%d", &n);
    for(int i = 0; i < n; i++) scanf("%s", S);

    dp[n][n] = 1;

    for(int i = 0; i < n; i++) {
        int cnt = 1;
        bool ok = true;
        for(int j = 0; j <= n; j++) {
            lf[i][j] = cnt;
            if(S[i][j] == '0') ok = false;
            else if(S[i][j] == '1') cnt = 0;
            cnt += ok;
        }
    }
    for(int i = 0; i < n; i++) {
        int cnt = 1;
        bool ok = true;
        for(int j = 0; j < n; j++) {
            if(S[j][i] == '0') ok = false;
            else if(S[j][i] == '1') cnt = 0;
            cnt += ok;
            up[j][i] = cnt;
            lu[j][i] = ok && i > 0 && S[j][i - 1] == '0' ? lf[j][i - 1] : 0;
        }
    }

    for(int i = n - 1; i >= 0; i--) {
        // dp[i+1][j] -> dp[i][k]: up0[i][j-1]*up0[i][j-2]*...*up0[i][k+1]*up1[i][k]

        for(int j = 0; j <= n; j++)
            dp[i][j] = (dp[i][j] + 1LL * dp[i + 1][j] * lf[i][j]) % MOD;
        
        int cs = 0;
        for(int j = n; j >= 0; j--) {
            dp[i][j] = (dp[i][j] + 1LL * cs * lu[i][j]) % MOD;
            cs = (1LL * cs * up[i][j] + dp[i + 1][j]) % MOD;
        }
    }

    for(int i = 0; i <= n; i++) {
        for(int j = 0; j <= n; j++)
            printf("%d ", dp[i][j]);
            printf("\n");
    }

    int ans = 0;
    for(int i = 0; i <= n; i++) ans = (ans + dp[0][i]) % MOD;
    printf("%d\n", ans);
    return 0;
}