#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const ll MOD = 998244353;

struct Segtree {
	int n;
	vector<ll> tree;
	Segtree() {}
	Segtree(int n) : n(n), tree(4 * n + 5) {}
	void upd(int v, int s, int e, int idx, ll val) {
		if (s == e) {
			tree[v] = val;
			return;
		}
		int mid = (s + e) >> 1;
		if (idx <= mid) upd(v << 1, s, mid, idx, val);
		else upd(v << 1 | 1, mid + 1, e, idx, val);
		tree[v] = (tree[v << 1] + tree[v << 1 | 1]) % MOD;
	}
	int get(int v, int s, int e, int l, int r) {
		if (s == l && e == r) return tree[v];
		int mid = (s + e) >> 1;
		if (r <= mid) return get(v << 1, s, mid, l, r);
		else if (l >= mid + 1) return get(v << 1 | 1, mid + 1, e, l, r);
		return (get(v << 1, s, mid, l, mid) + get(v << 1 | 1, mid + 1, e, mid + 1, r)) % MOD;
	}
	void upd(int idx, int val) {
		upd(1, 0, n - 1, idx, val);
	}
	int get(int l, int r) {
		if (l > r) return 0;
		return get(1, 0, n - 1, l, r);
	}
};

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);

	string s;
	cin >> s;
	int n = s.length();
	int P = 0, C = 0, I = 0;
	ll ans = 0;

	map<int, vector<pair<int, int>>> IC, CP, PI;
	vector<ll> dp(n + 1);
	dp[0] = 1;

	IC[0].emplace_back(0, 0);
	CP[0].emplace_back(0, 0);
	PI[0].emplace_back(0, 0);
	for (int i = 0; i < n; i++) {
		if (s[i] == 'I') I++;
		else if (s[i] == 'C') C++;
		else P++;
		IC[I - C].emplace_back(make_pair(P - I, i + 1));
		CP[C - P].emplace_back(make_pair(I - C, i + 1));
		PI[P - I].emplace_back(make_pair(C - P, i + 1));
	}
	for (auto& e : IC) {
		sort(e.second.begin(), e.second.end());
	}
	for (auto& e : CP) {
		sort(e.second.begin(), e.second.end());
	}
	for (auto& e : PI) {
		sort(e.second.begin(), e.second.end());
	}

	map<int, map<int, int>> posIC, posCP, posPI;
	map<int, Segtree> sgtIC, sgtCP, sgtPI;
	for (auto& e : IC) {
		int sz = e.second.size();
		for (int i = 0; i < sz; i++) {
			posIC[e.first][e.second[i].second] = i;
		}
		sgtIC[e.first] = Segtree(sz);
	}
	for (auto& e : CP) {
		int sz = e.second.size();
		for (int i = 0; i < sz; i++) {
			posCP[e.first][e.second[i].second] = i;
		}
		sgtCP[e.first] = Segtree(sz);
	}
	for (auto& e : PI) {
		int sz = e.second.size();
		for (int i = 0; i < sz; i++) {
			posPI[e.first][e.second[i].second] = i;
		}
		sgtPI[e.first] = Segtree(sz);
	}

	I = 0, P = 0, C = 0;
	sgtIC[0].upd(posIC[0][0], 1);
	sgtCP[0].upd(posCP[0][0], 1);
	sgtPI[0].upd(posPI[0][0], 1);

	for (int i = 0; i < n; i++) {
		if (s[i] == 'I') I++;
		else if (s[i] == 'C') C++;
		else P++;

		ll tmp = 0;
		{
			int sel = I - C;
			int atas = P - I;
			int x = lower_bound(IC[sel].begin(), IC[sel].end(), make_pair(atas, -1)) - IC[sel].begin();
			tmp = (tmp + sgtIC[sel].get(0, x - 1)) % MOD;
		}
		{
			int sel = C - P;
			int atas = I - C;
			int x = lower_bound(CP[sel].begin(), CP[sel].end(), make_pair(atas, -1)) - CP[sel].begin();
			tmp = (tmp + sgtCP[sel].get(0, x - 1)) % MOD;
		}
		{
			int sel = P - I;
			int atas = C - P;
			int x = lower_bound(PI[sel].begin(), PI[sel].end(), make_pair(atas, -1)) - PI[sel].begin();
			tmp = (tmp + sgtPI[sel].get(0, x - 1)) % MOD;
		}
		int i1 = posIC[I - C][i + 1];
		int i2 = posCP[C - P][i + 1];
		int i3 = posPI[P - I][i + 1];
		sgtIC[I - C].upd(i1, tmp);
		sgtCP[C - P].upd(i2, tmp);
		sgtPI[P - I].upd(i3, tmp);
		dp[i + 1] = tmp;
	}

	cout << dp[n] << '\n';

	return 0;
}