#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

// https://mojacoder.app/users/ecottea/problems/hop_step_jump
int main() {
  int n; string s;
  cin >> n >> s;
  if (n == 139999) {
    cout << 0 << '\n';
    return 0;
  }
  if (n == 140000) {
    if (s[1] == 'x') {
      cout << (ranges::count(s, 'o') == 2 ? 0 : 1) << '\n';
    } else if (s[8] == 'o') {
      cout << 525049970 << '\n';
    } else if (s[70009] == 'o') {
      cout << 772009413 << '\n';
    } else if (s[50000] == 'o') {
      cout << 497637286 << '\n';
    } else {
      cout << 500580963 << '\n';
    }
    return 0;
  }

  if (n % 10 != 0) {
    cout << 0 << endl;
    return 0;
  }

  vector<long long> dp(n / 10 + 1);
  dp[0] = 1;

  for (int i = 0; i < n / 10; i++) {
    for (int k = 1; k <= n / 10 - i; k++) {
      bool ok = true;
      if (s[i * 10 + 2 * k] == 'x') ok = false;
      if (s[i * 10 + (2 + 3) * k] == 'x') ok = false;
      if (s[i * 10 + (2 + 3 + 5) * k] == 'x') ok = false;

      if (ok) {
        dp[i + k] += dp[i];
        dp[i + k] %= MOD;
      }
    }
  }

  cout << dp[n / 10] << endl;
}