#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
//using mint=modint1000000007;
using mint=modint998244353;
void chmax(ll&a,ll b){a=max(a,b);}
void chmin(ll&a,ll b){a=min(a,b);}
signed main(){
  ll N;cin>>N;string S;
  REP(i,N){string s;cin>>s;S+=s;}S+='.';
  vector<vector<mint>>DP(3,vector<mint>(8*N+1));
  DP[0][0]=1;
  //..,n.,nn
  REP(i,8*N){
    if(S[2*i]=='.'&&S[2*i+1]=='.')DP[0][i+1]=DP[0][i]+DP[1][i];
    if(S[2*i+1]=='.'){
      if(S[2*i]=='.')DP[1][i+1]=2*(DP[0][i]+DP[1][i]+DP[2][i]);
      else DP[1][i+1]=DP[0][i]+DP[1][i]+DP[2][i];
    }
    if(S[2*i]=='.'){
      if(S[2*i+1]=='.'){
        if(S[2*i+2]=='.')DP[2][i+1]=4*(DP[0][i]+DP[1][i]+DP[2][i]);
        else DP[2][i+1]=2*(DP[0][i]+DP[1][i]+DP[2][i]);
      }
      else DP[2][i+1]=DP[0][i]+DP[1][i]+DP[2][i];
    }
    else{
      if(S[2*i+1]=='.'&&S[2*i+2]=='.')DP[2][i+1]=2*(DP[0][i]+DP[1][i]+DP[2][i]);
      else DP[2][i+1]=DP[0][i]+DP[1][i]+DP[2][i];
    }
  }
  cout<<(DP[0][8*N]+DP[1][8*N]+DP[2][8*N]).val()<<endl;
  return 0;
}