#include <bits/stdc++.h>
#define rep(i, p, n) for (ll i = p; i < (ll)(n); i++)
#define rep2(i, p, n) for (ll i = p; i >= (ll)(n); i--)
using namespace std;
using ll = long long;
using ld = long double;
const double pi = 3.141592653589793;
const long long inf = 2 * 1e9;
const long long linf = 4 * 1e18;
const ll mod1 = 1000000007;
const ll mod2 = 998244353;
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}

// atcoder
#include <atcoder/all>
using namespace atcoder;
using mint1 = modint1000000007;
using mint2 = modint998244353;

vector<pair<ll, ll>> base = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

int main()
{

    //////////////////
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    //////////////////

    ll N;
    string S;
    cin >> N >> S;
    mint2 dp[N][3][2][2];
    if (S.at(0) != 'x')
    {
        dp[0][2][0][0] = 1;
    }
    if (S.at(0) != 'o')
    {
        dp[0][2][0][1] = 1;
    }
    rep(i, 0, N - 1)
    {
        if (S.at(i + 1) != 'x')
        {
            dp[i + 1][1][0][0] += dp[i][0][0][0];
            dp[i + 1][0][1][0] += dp[i][0][0][1];
            dp[i + 1][1][1][0] += dp[i][0][1][0];
            dp[i + 1][2][0][0] += dp[i][1][0][0];
            dp[i + 1][0][0][0] += dp[i][1][0][1];
            dp[i + 1][2][0][0] += dp[i][1][1][0];
            dp[i + 1][0][1][0] += dp[i][1][1][1];
            dp[i + 1][2][0][0] += dp[i][2][0][0];
            dp[i + 1][0][0][0] += dp[i][2][0][1];
        }
        if (S.at(i + 1) != 'o')
        {
            dp[i + 1][1][0][1] += dp[i][0][0][1];
            dp[i + 1][0][1][1] += dp[i][0][0][0];
            dp[i + 1][1][1][1] += dp[i][0][1][1];
            dp[i + 1][2][0][1] += dp[i][1][0][1];
            dp[i + 1][0][0][1] += dp[i][1][0][0];
            dp[i + 1][2][0][1] += dp[i][1][1][1];
            dp[i + 1][0][1][1] += dp[i][1][1][0];
            dp[i + 1][2][0][1] += dp[i][2][0][1];
            dp[i + 1][0][0][1] += dp[i][2][0][0];
        }
    }
    mint2 ans = 0;
    rep(i, 0, 3)
    {
        rep(j, 0, 2)
        {
            rep(k, 0, 2)
            {
                ans += dp[N - 1][i][j][k];
            }
        }
    }
    cout << ans.val();
}