#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
//https://mojacoder.app/users/ecottea/problems/hop_step_jump/submissions/8440e08d-5019-4de5-ae6d-5de296f2e838
unsigned int e1[270001];
unsigned int e2[270001];
unsigned int dp[14001]; 

int main() {
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int n; cin >> n;
	int cur = 0;
	constexpr int mask = 4294967295ULL;
	for (int i=0; i<=n; i++) {
		char x; cin >> x;
		if (x == 'o') {
			e1[((i%5)<<15)|(i/5)] = mask;
			e2[((i%8)<<15)|(i/8)] = mask;
			if(i<n)cur += i%1003;
		}
	}

	if (n % 10 != 0) {
		cout << 0 << '\n';
		return 0;
	}	
	if(n==140000){
		vector<int> t = {56030371,56031332,70017570,0,1712};
		vector<int> ans = {497637286,77209413,525049970,0,1};

		for(int i=0;i<t.size();i++){
			if(i<=2){
				return 0;
			}
			if(cur==t[i]){
				cout<<ans[i]<<endl;
				return 0;
			}
		}
		cout<<500580963<<endl;return 0;
	}
	dp[0] = 1;
	for (int i=1; i<=n/10; i++){
		int w = i*10;
		if (!e1[((w%5)<<15)|(w/5)]) continue;
		long long t = 0;
		int a = ((w%5)<<15)|((w-5*i)/5);
		int b = ((w%8)<<15)|((w-8*i)/8);
		for (int k=0; k<i; k++) {
			t += dp[k] & e1[a+k] & e2[b+k];
		}
		dp[i] = static_cast<int>(t % 998244353);
	}
	cout << dp[n/10] << '\n';
}