#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
typedef pair<int, int> pii;
const int inf=INT_MAX;
const int maxn=3010;
const int md=998244353;

int n;
char mat[maxn][maxn];

int dp[maxn][maxn];
int cf0[maxn];
int lf0[maxn];

int lult1[maxn][maxn];
int cult1[maxn][maxn];

int32_t main()
{
    #ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout); 
    #endif
    ios::sync_with_stdio(0);cin.tie(0);

    cin>> n;
    for(int i=1; i<=n; i++)
    {
        string s; cin>> s;
        for(int j=1; j<=n; j++)
            mat[i][j] = s[j-1];
    }
    for(int i=1; i<=n; i++)
    {
        lf0[i] = n+1;
        for(int j=n; j>=1; j--)
            if(mat[i][j] == '0')
                lf0[i] = j;
        int ult1 = 0;
        for(int j=1; j<=n; j++)
        {
            if(mat[i][j] == '1')
                ult1 = j;
            lult1[i][j] = ult1;
        }
    }
    for(int j=1; j<=n; j++)
    {
        cf0[j] = n+1;
        for(int i=n; i>=1; i--)
            if(mat[i][j] == '0')
                cf0[j] = i;
        int ult1 = 0;
        for(int i=1; i<=n; i++)
        {
            if(mat[i][j] == '1')
                ult1 = i;
            cult1[i][j] = ult1;
        }
    }
    for(int i=0; i<=n; i++)
    {
        for(int j=0; j<=n; j++)
        {
            if(i == 0 || j == 0)
            {
                dp[i][j] = 1;
                continue;
            }
            int ult1i = cult1[i][j];
            int ult1j = lult1[i][j];
            if(i < cf0[j]) dp[i][j] += dp[i][j-1]; // tudo 1 ultima coluna
            if(j < lf0[i]) dp[i][j] += dp[i-1][j]; // tudo 1 ultima linha
            if(i < cf0[j] && j < lf0[i]) dp[i][j] -= dp[i-1][j-1]; // tudo 1 ultima coluna e linha
            // os casos acima são os casos em que (i, j) é 1, suponha que (i, j) é 0
            int a = max((ll)0, min(j, lf0[i]) - ult1j), b = max((ll)0, min(i, cf0[j]) - ult1i), c = a * b;
            dp[i][j] += dp[i-1][j] * a % md + dp[i][j-1] * b % md - dp[i-1][j-1] * c % md;
            while(dp[i][j] >= md) dp[i][j] -= md; while(dp[i][j] < 0) dp[i][j] += md;
        }
    }
    cout<< dp[n][n]<< "\n";

    return 0;
}