#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) { a = max(a, b); }
template<class T> void chmin(T& a, const T& b) { a = min(a, b); }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  n *= 16;
  string s;
  rep(_, n) {
    char c;
    cin >> c;
    s += c;
  }
  VI cands(n, 7);
  rep(i, n) {
    if (s[i] != '.') {
      cands[i] = s[i] == 'd' ? 2 : 4;
    }
  }
  rep(i, n - 1) {
    if (s[i] == '.' && s[i + 1] != '.') {
      cands[i] &= 7 ^ cands[i + 1];
    }
  }
  using A = array<mint, 3>;
  A dp{};
  dp[0] = 1;
  rep(i, n) {
    A ndp{};
    if (cands[i] & 1) {
      if (i % 2 == 0) ndp[0] = dp[0];
      else ndp[0] = dp[0] + dp[1] + dp[2];
    }
    if (cands[i] >> 1 & 1) {
      if (i % 2 == 0) ndp[1] = dp[0] + dp[1] + dp[2];
      else ndp[1] = dp[1] + dp[2];
    }
    if (cands[i] >> 2 & 1) {
      if (i % 2 == 0) ndp[2] = dp[0] + dp[1] + dp[2];
      else ndp[2] = dp[1] + dp[2];
    }
    dp = ndp;
  }
  mint ans = dp[0] + dp[1] + dp[2];
  cout << ans.val() << '\n';
}