#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second

typedef long long ll;
#define int ll

using namespace std;

const int mod = 998244353;

string s[3030];
int a[3030][3030];
int dp[3030][3030];

vector<int> zs1[3030], zs2[3030], os1[3030], os2[3030];
void calc(int n, int m)
{
//    if (n==1 && m==1)
//    {
//        dp[n][m] = (a[n][m] == -1) + 1;
//        return;
//    }

    int ans = 0;
    if (a[n][m] != 0)
    {
        if (zs1[n][1] > m) ans += dp[n-1][m];
        if (zs2[m][1] > n) ans += dp[n][m-1];
        if (zs1[n][1] > m && zs2[m][1] > n)
            ans -= dp[n-1][m-1];
//        cout<<n<<" "<<m<<" -> "<<ans<<"\n";
    }
    if (a[n][m] != 1)
    {
        int r1 = min(m-1, zs1[n][1]-1);
        auto it1 = upper_bound(os1[n].begin(), os1[n].end(), r1);
        int l1 = *prev(it1);
        if (*it1 <= m) l1 = r1+1;
        ans += (r1-l1+1)*dp[n-1][m];

//        cout<<n<<" "<<m<<" -> "<<ans<<"\n";
        int r2 = min(n-1, zs2[m][1]-1);
        auto it2 = upper_bound(os2[m].begin(), os2[m].end(), r2);
        int l2 = *prev(it2);
        if (*it2 <= n) l2 = r2+1;
        ans += (r2-l2+1)*dp[n][m-1];

//        cout<<n<<" "<<m<<" -> "<<ans<<"\n";
        ans -= (r2-l2+1)*(r1-l1+1)*dp[n-1][m-1];
//        cout<<n<<" "<<m<<" -> "<<ans<<"\n";
    }

    dp[n][m] = (ans%mod+mod)%mod;
}

main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin>>n;
    for (int i=0; i<n; i++)
        cin>>s[i];
    for (int i=1; i<=n; i++)
    {
        zs1[i].pb(0);
        zs2[i].pb(0);
        os1[i].pb(0);
        os2[i].pb(0);
    }
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++)
    {
        a[i][j] = -1;
        if (s[i-1][j-1] == '0')
            zs1[i].pb(j), zs2[j].pb(i), a[i][j] = 0;
        if (s[i-1][j-1] == '1')
            os1[i].pb(j), os2[j].pb(i), a[i][j] = 1;
    }
    for (int i=1; i<=n; i++)
    {
        zs1[i].pb(n+1);
        zs2[i].pb(n+1);
        os1[i].pb(n+1);
        os2[i].pb(n+1);
    }
    for (int i=0; i<=n; i++)
        dp[0][i] = dp[i][0] = 1;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++)
            calc(i, j);
//    for (int i=1; i<=n; i++, cout<<"\n")
//        for (int j=1; j<=n; j++)
//            cout<<dp[i][j]<<" ";
    cout<<dp[n][n]<<"\n";
}