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

using i64 = long long;

constexpr int P = 998244353;
// assume -P <= x < 2P
int norm(int x) {
    if (x < 0) {
        x += P;
    }
    if (x >= P) {
        x -= P;
    }
    return x;
}
template<class T>
T power(T a, i64 b) {
    T res = 1;
    for (; b; b /= 2, a *= a) {
        if (b % 2) {
            res *= a;
        }
    }
    return res;
}
struct Z {
    int x;
    Z(int x = 0) : x(norm(x)) {}
    Z(i64 x) : x(norm(x % P)) {}
    int val() const {
        return x;
    }
    Z operator-() const {
        return Z(norm(P - x));
    }
    Z inv() const {
        assert(x != 0);
        return power(*this, P - 2);
    }
    Z &operator*=(const Z &rhs) {
        x = i64(x) * rhs.x % P;
        return *this;
    }
    Z &operator+=(const Z &rhs) {
        x = norm(x + rhs.x);
        return *this;
    }
    Z &operator-=(const Z &rhs) {
        x = norm(x - rhs.x);
        return *this;
    }
    Z &operator/=(const Z &rhs) {
        return *this *= rhs.inv();
    }
    friend Z operator*(const Z &lhs, const Z &rhs) {
        Z res = lhs;
        res *= rhs;
        return res;
    }
    friend Z operator+(const Z &lhs, const Z &rhs) {
        Z res = lhs;
        res += rhs;
        return res;
    }
    friend Z operator-(const Z &lhs, const Z &rhs) {
        Z res = lhs;
        res -= rhs;
        return res;
    }
    friend Z operator/(const Z &lhs, const Z &rhs) {
        Z res = lhs;
        res /= rhs;
        return res;
    }
    friend std::istream &operator>>(std::istream &is, Z &a) {
        i64 v;
        is >> v;
        a = Z(v);
        return is;
    }
    friend std::ostream &operator<<(std::ostream &os, const Z &a) {
        return os << a.val();
    }
};

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int n;
    cin >> n;
    vector s(n + 1, string());
    for(int i = 1; i <= n; i++) {
        cin >> s[i];
        s[i] = ' ' + s[i];
    }
    vector a(n + 1, vector(n + 1, 0));
    for(int i = 1; i <= n; i++) {
        int lst1 = 0, fir0 = -1;
        a[i][0] = 1;
        for(int j = 1; j <= n; j++) {
            if(s[i][j] == '1') {
                lst1 = j;
            } else if(s[i][j] == '0' && fir0 == -1) {
                fir0 = j;
            }
            if(fir0 == -1) a[i][j] = j - lst1 + 1;
            else a[i][j] = max(0, fir0 - lst1);
        }
    }
    vector b(n + 1, vector(n + 1, 0));
    vector c(n + 1, vector(n + 1, 0));
    for(int j = 1; j <= n; j++) {
        int lst1 = 0, fir0 = -1;
        b[0][j] = c[0][j] = 1;
        for(int i = 1; i <= n; i++) {
            if(s[i][j] == '1') {
                lst1 = i;
            } else if(s[i][j] == '0' && fir0 == -1) {
                fir0 = i;
            }
            if(fir0 == -1) b[i][j] = i - lst1 + 1, c[i][j] = 1;
            else b[i][j] = max(0, fir0 - lst1), c[i][j] = 0;
        }
    }
    // for(int i = 1; i <= n; i++) {
    //     for(int j = 1; j <= n; j++) {
    //         cout << a[i][j] << " \n"[j == n];
    //     }
    // }
    // for(int i = 1; i <= n; i++) {
    //     for(int j = 1; j <= n; j++) {
    //         cout << b[i][j] << " \n"[j == n];
    //     }
    // }
    // for(int i = 1; i <= n; i++) {
    //     for(int j = 1; j <= n; j++) {
    //         cout << c[i][j] << " \n"[j == n];
    //     }
    // }
    vector f(n + 1, vector(n + 1, array<Z, 2>({0, 0})));
    f[0][1][0] = 1, f[1][0][1] = 1;
    for(int i = 0; i <= n; i++) {
        for(int j = 0; j <= n; j++) {
            if(i == 0 && j == 0) continue;
            if(j < n) {
                f[i][j + 1][0] += f[i][j][0] * b[i][j + 1];
                if(a[i][j] && j) {
                    f[i][j + 1][0] += f[i][j][1] * c[i][j + 1] * a[i][j - 1] * (s[i][j] != '1') / a[i][j];
                }
            }
            if(i < n) {
                f[i + 1][j][1] += f[i][j][0] * a[i + 1][j] + f[i][j][1] * a[i + 1][j];
            }
        }
    }
    cout << f[n][n][0] + f[n][n][1] << "\n";
    return 0;
}