#include<bits/stdc++.h>
using namespace std;

int mod = 998244353;

int add(int a, int b) {
    return a + b >= mod ? a + b - mod : a + b;
}
int sub(int a, int b) {
    return a >= b ? a - b : a + mod - b;
}
int mul(int a, int b) {
    return 1ll * a * b % mod;
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    
    int n;
    cin >> n;
    vector<string> a(n);
    for (auto& i : a) cin >> i;
    vector<vector<int>> dp(n + 1, vector<int>(n + 1, 1));
    vector<vector<int>> lft(n, vector<int>(n, -1)), up(n, vector<int>(n, -1));
    vector<vector<int>> rgt(n, vector<int>(n, 0)), down(n, vector<int>(n, 0));
    vector<vector<bool>> zero_lft(n, vector<bool>(n, false)), zero_up(n, vector<bool>(n, false));
    for (int i = 0; i < n; ++i) {
        int cur = -1;
        for (int j = 0; j < n; ++j) {
            if (a[i][j] == '1') cur = j;
            lft[i][j] = cur;
        }
    }
    for (int j = 0; j < n; ++j) {
        int cur = -1;
        for (int i = 0; i < n; ++i) {
            if (a[i][j] == '1') cur = i;
            up[i][j] = cur;
        }
    }
    for (int i = 0; i < n; ++i) {
        int cur = 0;
        for (int j = n - 1; j >= 0; --j) {
            if (a[i][j] == '0') cur = 0;
            else cur++;
            rgt[i][j] = cur;
        }
    }
    for (int j = 0; j < n; ++j) {
        int cur = 0;
        for (int i = n - 1; i >= 0; --i) {
            if (a[i][j] == '0') cur = 0;
            else cur++;
            down[i][j] = cur;
        }
    }
    for (int i = 0; i < n; ++i) {
        bool cur = false;
        for (int j = 0; j < n; ++j) {
            cur |= a[i][j] == '0';
            zero_lft[i][j] = cur;
        }
    }
    for (int j = 0; j < n; ++j) {
        bool cur = false;
        for (int i = 0; i < n; ++i) {
            cur |= a[i][j] == '0';
            zero_up[i][j] = cur;
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            int ret = 0;
            int l1, r1, l2, r2;
            l1 = lft[i][j];
            r1 = max(l1, 0) + rgt[i][max(l1, 0)] - 1;
            l2 = up[i][j];
            r2 = max(l2, 0) + down[max(l2, 0)][j] - 1;
            r1 = min(r1, j);
            r2 = min(r2, i);
            if (l1 < 0 || !zero_lft[i][l1]) ret = add(ret, mul(r1 - l1 + 1, dp[i][j + 1]));
            if (l2 < 0 || !zero_up[l2][j]) ret = add(ret, mul(r2 - l2 + 1, dp[i + 1][j]));
            r1 = min(r1, j - 1);
            r2 = min(r2, i - 1);
            if ((l1 < 0 || !zero_lft[i][l1]) && (l2 < 0 || !zero_up[l2][j])) ret = sub(ret, mul(mul(r1 - l1 + 1, r2 - l2 + 1), dp[i][j]));
            if (!zero_lft[i][j] && !zero_up[i][j]) ret = sub(ret, dp[i][j]);
            dp[i + 1][j + 1] = ret;
        }
    }
    cout << dp[n][n] << '\n';
}