#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long modpow(long long a, long long b){
	long long ans = 1;
	while (b > 0){
		if (b % 2 == 1){
			ans *= a;
			ans %= MOD;
		}
		a *= a;
		a %= MOD;
		b /= 2;
	}
	return ans;
}
long long modinv(long long a){
	return modpow(a, MOD - 2);
}
vector<long long> mf = {1};
long long modfact(int n){
	if (mf.size() > n){
		return mf[n];
	} else {
		for (int i = mf.size(); i <= n; i++){
			long long next = mf.back() * i % MOD;
			mf.push_back(next);
		}
		return mf[n];
	}
}
vector<long long> ntt(vector<long long> A, bool inv){
	int N = A.size();
	long long r = 3;
	if (inv){
		r = modinv(r);
	}
	vector<long long> B(N);
	for (int i = N / 2; i > 0; i /= 2){
		long long z = modpow(r, (MOD - 1) / (N / i));
		long long z2 = 1;
		for (int j = 0; j < N; j += i * 2){
			for (int k = 0; k < i; k++){
				A[i + j + k] *= z2;
				A[i + j + k] %= MOD;
				B[j / 2 + k] = (A[j + k] + A[i + j + k]) % MOD;
				B[N / 2 + j / 2 + k] = (A[j + k] - A[i + j + k] + MOD) % MOD;
			}
			z2 = z2 * z % MOD;
		}
		swap(A, B);
	}
	if (inv){
		int Ninv = modinv(N);
		for (int i = 0; i < N; i++){
			A[i] = A[i] * Ninv % MOD;
		}
	}
	return A;
}
vector<long long> convolution(vector<long long> A, vector<long long> B, int d = -1){
	int deg = A.size() + B.size() - 1;
	int N = 1;
	while (N < deg){
		N *= 2;
	}
	A.resize(N);
	B.resize(N);
	A = ntt(A, false);
	B = ntt(B, false);
	vector<long long> ans(N);
	for (int i = 0; i < N; i++){
		ans[i] = A[i] * B[i] % MOD;
	}
	ans = ntt(ans, true);
	if (d != -1){
		deg = d;
	}
	ans.resize(deg);
	return ans;
}
int main(){
  int N;
  cin >> N;
  string S;
  cin >> S;
  vector<long long> f1(N, 0);
  for (int i = 0; i < N; i++){
    if (S[i] == 'i'){
      f1[N - 1 - i] = 1;
    }
  }
  vector<long long> g1(N, 0);
  for (int i = 0; i < N; i++){
    if (S[i] == 'n'){
      g1[i] = 1;
    }
  }
  vector<long long> h1 = convolution(f1, g1);
  vector<long long> t(N - 1);
  for (int i = 0; i < N - 1; i++){
    t[i] = h1[i + N];
  }
  vector<long long> f2(N - 1);
  for (int i = 0; i < N - 1; i++){
    f2[i] = t[i] * modfact(i);
  }
  vector<long long> g2(N - 1);
  for (int i = 0; i < N - 1; i++){
    g2[i] = modinv(modfact(N - 2 - i));
  }
  vector<long long> h2 = convolution(f2, g2);
  vector<long long> X(N - 1);
  for (int i = 0; i < N - 1; i++){
    X[i] = h2[i + N - 2] * modinv(modfact(i)) % MOD;
  }
  long long ans = 0;
  for (int i = 0; i < N - 1; i++){
    ans ^= X[i];
  }
  cout << ans << endl;
}