#include <atcoder/modint>
#include <atcoder/convolution>
#include <iostream>
#include <algorithm>
#include <vector>

template <class T>
struct Combination {
    int max_n;
    std::vector<T> f, invf;

    explicit Combination(int n)
        : max_n(n), f(n + 1), invf(n + 1) {
        f[0] = 1;
        for (int i = 1; i <= n; ++i) {
            f[i] = f[i - 1] * i;
        }

        invf[max_n] = f[max_n].inv();
        for (int i = max_n - 1; i >= 0; --i) {
            invf[i] = invf[i + 1] * (i + 1);
        }
    }

    T fact(int n) const { return n < 0 ? T(0) : f[n]; }
    T invfact(int n) const { return n < 0 ? T(0) : invf[n]; }
    T perm(int a, int b) const {
        return a < b || b < 0 ? T(0) : f[a] * invf[a - b];
    }
    T binom(int a, int b) const {
        return a < b || b < 0 ? T(0) : f[a] * invf[a - b] * invf[b];
    }
};

using namespace std;
using mint = atcoder::modint998244353;

const Combination<mint> C(300000);

void solve() {
    int n;
    cin >> n;

    vector<mint> is(n, 0), ns(n, 0);
    for (int i = 0; i < n; ++i) {
        char c;
        cin >> c;
        if (c == 'i') {
            is[n - i - 1] = 1;
        } else {
            ns[i] = 1;
        }
    }

    auto fs = atcoder::convolution(is, ns);
    // s[i]='n'とs[n-j-1]='i' => i+j
    // k = i-(n-j-1)-1 = (i+j)-n
    fs.erase(fs.begin(), fs.begin() + n);

    // x -> x+1
    {
        for (int i = 0; i <= n - 2; ++i) fs[i] *= C.fact(i);
        reverse(fs.begin(), fs.end());

        // exp(cx) = sum_i (c^i x^i / i!)
        vector<mint> es(n - 1);
        for (int i = 0; i <= n - 2; ++i) es[i] = C.invfact(i);

        fs = atcoder::convolution(fs, es);
        fs.resize(n - 1);

        reverse(fs.begin(), fs.end());
        for (int i = 0; i <= n - 2; ++i) fs[i] *= C.invfact(i);
    }

    int ans = 0;
    for (auto f : fs) ans ^= f.val();
    cout << ans << "\n";
}

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

    solve();

    return 0;
}