#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 3005;
int n;
char s[N][N];
ll f[N][N], w[N][N];
bool vis[N][N];

int main(){
    read(n);
    _rep(i, 0, n) f[0][i] = w[0][i] = 1;
    _rep(i, 1, n){
        scanf("%s", s[i] + 1);
        _rep(j, 1, n){
            vis[i][j] = vis[i - 1][j] | (s[i][j] == '0');
            if(!vis[i][j]){
                if(s[i][j] == '1') w[i][j] = 1;
                else w[i][j] = w[i - 1][j] + 1;
            }else{
                if(s[i][j] == '1') w[i][j] = 0;
                else w[i][j] = w[i - 1][j];
            }
        }
        ll cur = 0;
        bool flag = 0;
        ll lst0 = 0, lst1 = 0, lst = 1;
        _rep(j, 1, n){
            if(s[i][j] == '1'){
                if(flag) break;
                lst1 = j;
            }
            if(s[i][j] == '0'){
                if(!flag) lst0 = j;
                flag = 1;
            }
            mul(cur, w[i][j]);
            add(cur, f[i - 1][j - 1] * (lst - (!lst0)) % mod * (!vis[i][j]) % mod);
            ll t = 0;
            if(lst0) t = lst0 - lst1;
            else t = j - lst1 + 1;
            f[i][j] = (cur + f[i - 1][j] * t % mod) % mod;
            lst = t;
        }
    }
    debug("%d\n", f[1][1]);
    writeln(f[n][n]);
    return 0;
}