#include <bits/stdc++.h>
#define db double
#define il inline
#define re register
#define ll long long
#define ui unsigned
#define ull ui ll
#define i128 __int128
#define pii pair<int, int>
#define fi first
#define se second
#define eb emplace_back
#define SZ(v) (int)v.size()
#define ALL(v) v.begin(), v.end()
#define mems(v, x) memset(v, x, sizeof(v))
#define memc(a, b) memcpy(a, b, sizeof(a))
#define FOR(i, L, R) for(re int i = (L); i <= (R); ++i)
#define ROF(i, R, L) for(re int i = (R); i >= (L); --i)
#define LS i << 1, l, mid
#define RS i << 1 | 1, mid + 1, r
#define popc(x) __builtin_popcount(x)
using namespace std;
#define N 3005
#define P 998244353
il int add(int x, int y) {return x + y < P ? x + y : x + y - P;}
il void addr(int &x, int y) {(x += y) >= P && (x -= P);}
il int qpow(int p, int n = P - 2) {
  int s = 1;
  while(n) {
    if(n & 1) s = 1ll * s * p % P;
    p = 1ll * p * p % P, n >>= 1;
  }
  return s;
}
il void chkmin(int &x, int y) {(x > y) && (x = y);}
int n;
string str[N];
int dp[N][N];
bool F[N]; int C[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> n;
  FOR(i, 1, n) cin >> str[i], str[i] = "1" + str[i];
  dp[0][0] = 1;
  FOR(i, 0, n) C[i] = 1;
  FOR(i, 1, n) {
    bool f = 0; int c, s = 0;
    FOR(j, 0, n) {
      if(str[i][j] == '0') f = 1;
      if(str[i][j] == '1') {
        if(f) c = 0; else c = 1;
      }
      if(str[i][j] == '?' && !f) ++c;
      addr(dp[i][j], 1ll * c * dp[i - 1][j] % P);
      if(!f) {
        if(F[j]) addr(dp[i][j], 1ll * C[j] * s % P);
        else addr(dp[i][j], 1ll * (C[j] - 1) * s % P);
      }
      s = add(1ll * s * C[j] % P, dp[i - 1][j]);
      if(str[i][j] == '0') F[j] = 1;
      if(str[i][j] == '1') {
        if(F[j]) C[j] = 0; else C[j] = 1;
      }
      if(str[i][j] == '?' && !F[j]) ++C[j];
    }
  }
  int s = 0;
  FOR(j, 0, n) s = add(1ll * s * C[j] % P, dp[n][j]);
  cout << s;
  cerr << 1.0 * clock() / CLOCKS_PER_SEC << "\n";
  return 0;
}