#include #include using namespace std; using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; using mint = modint998244353; const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; //const bool debug = false; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; string s; rep(i, n) { string t; cin >> t; s += t; } n *= 16; vectorvl, vr; { int i = 0; for (; i < n; ++i) { if ('.' != s[i])continue; int l = i, r = i; for (; i < n; ++i) { if ('.' != s[i])break; r = i; } vl.push_back(l); vr.push_back(r + 1); } } mint ans = 1; rep(i, vl.size()) { //[l,r) vector> dp(vr[i] - vl[i] + 1, vector(2)); if (0 == vl[i])dp[0][0] = 1; else dp[0][1] = 1; rep2(j, vl[i], vr[i]) { int idx = j - vl[i]; if (0 == j % 2) { rep(k, 2) { if (0 == k) { dp[idx + 2][0] += dp[idx][k]; dp[idx + 1][1] += dp[idx][k]; if ((j != (vr[i] - 1)) || ((n - 1) == j))dp[idx + 1][1] += dp[idx][k]; } else { dp[idx + 1][1] += dp[idx][k]; if ((j != (vr[i] - 1)) || ((n - 1) == j))dp[idx + 1][1] += dp[idx][k]; } } } else { rep(k, 2) { dp[idx + 1][0] += dp[idx][k]; dp[idx + 1][1] += dp[idx][k]; if ((j != (vr[i] - 1)) || ((n - 1) == j))dp[idx + 1][1] += dp[idx][k]; } } } mint sub = dp[vr[i] - vl[i]][0] + dp[vr[i] - vl[i]][1]; ans *= sub; } cout << ans.val() << endl; return 0; }