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

using LL = long long;
const int N = 3005;
const int P = 998244353;

int n;
int L[N], R[N];
LL f[N][N];
char s[N][N];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> (s[i] + 1);
  fill(f[0], f[0] + n + 1, 1);
  for (int i = 1; i <= n; ++i) R[i] = n + 1;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      if (s[i][j] == '1') L[j] = i;
      if (s[i][j] == '0') R[j] = min(R[j], i);
    }
    int l = 0, r = n + 1;
    LL ss = 0;
    for (int j = 1; j <= n; ++j) {
      if (L[j] >= R[j]) ss = 0;
      else {
        (ss *= min(R[j], i + 1) - L[j]) %= P;
      }
      if (j > 1 && l < min(r, j - 1) && R[j] > i) {
        (ss += f[i - 1][j - 1] * (min(r, j - 1) - l)) %= P;
      }
      if (s[i][j] == '1') l = j;
      if (s[i][j] == '0') r = min(r, j);
      f[i][j] = ss;
      if (l < r) {
        (f[i][j] += f[i - 1][j] * (min(r, j + 1) - l)) %= P;
      }
    }
  }
  cout << f[n][n] << "\n";
  return 0;
}