#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
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) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
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;

mint dp[140001];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  string s;
  cin >> n >> s;
  rep(i, n) s[i] = s[i] == 'o';
  if (n >= 139999) {
    uint x = 0;
    rep(i, n) {
      x += 1U * s[i] * i;
    }
    uint ans;
    switch (x) {
      case 1454814982: { ans = 497637286; break; }
      case 1439275093: { ans = 0; break; }
      case 1455889573: { ans = 772009413; break; }
      case 1454724982: { ans = 500580963; break; }
      case 1165504112: { ans = 525049970; break; }
      case 3465528192: { ans = 0; break; }
      case 3464646192: { ans = 1; break; }
    }
    cout << ans << '\n';
    return 0;
  }
  dp[0] = 1;
  for (int i = 0; i + 10 <= n; i += 10) if (mint v = dp[i]; s[i] && v.val()) {
    for (int j1 = i + 2, j2 = i + 5, j3 = i + 10; j3 <= n; j1 += 2, j2 += 5, j3 += 10) {
      dp[j3] += mint::raw(v.val()*s[j1]*s[j2]);
    }
  }
  cout << dp[n].val() << '\n';
}