/* -*- coding: utf-8 -*-
 *
 * 1766.cc:  No.1766 Tatsujin Remix - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 12500;
const int L = 16;
const int MAX_M = MAX_N * L;
const int MOD = 998244353;

/* typedef */

template<const int MOD>
struct MI {
  int v;
  MI(): v() {}
  MI(int _v): v(_v % MOD) {}
  MI(long long _v): v(_v % MOD) {}

  MI operator+(const MI m) const { return MI(v + m.v); }
  MI operator-(const MI m) const { return MI(v + MOD - m.v); }
  MI operator*(const MI m) const { return MI((long long)v * m.v); }

  MI &operator+=(const MI m) { return (*this = *this + m); }
  MI &operator-=(const MI m) { return (*this = *this - m); }
  MI &operator*=(const MI m) { return (*this = *this * m); }
};

typedef MI<MOD> mi;

/* global variables */

char s[L + 4];
bool ts[MAX_M];
mi dp[MAX_M + 1][2];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  int m = 0;
  for (int i = 0; i < n; i++) {
    scanf("%s", s);
    for (int j = 0; j < L; j++)
      ts[m++] = (s[j] != '.');
  }
  //printf("m=%d\n", m);

  dp[0][0] = 1;
  for (int i = 0; i < m; i++) {
    if (! (i & 1)) {
      if (ts[i])
	dp[i + 1][1] = dp[i][0] + dp[i][1];
      else {
	dp[i + 1][0] = dp[i][0];
	if (i + 1 < m && ts[i + 1])
	  dp[i + 1][1] = dp[i][0] + dp[i][1];
	else
	  dp[i + 1][1] = (dp[i][0] + dp[i][1]) * 2;
      }
    }
    else {
      if (ts[i])
	dp[i + 1][1] = dp[i][1];
      else {
	dp[i + 1][0] = dp[i][0] + dp[i][1];
	if (i + 1 < m && ts[i + 1])
	  dp[i + 1][1] = dp[i][1];
	else
	  dp[i + 1][1] = dp[i][1] * 2;
      }
    }
  }

  printf("%d\n", (dp[m][0] + dp[m][1]).v);
  return 0;
}