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

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int mod = 998244353;

void add(int& a, int b)
{
	a += b;
	if (a >= mod)
		a -= mod;
}

struct Fenwick
{
	int n;
	vector<int> t;
	
	void init(int nn)
	{
		n = nn;
		t.resize(n);
	}
	
	void inc(int i, int d)
	{
		for (; i < n; i = (i | (i + 1)))
			add(t[i], d);
	}
	
	int get(int i)
	{
		int ans = 0;
		for (; i >= 0; i = (i & (i + 1)) - 1)
			add(ans, t[i]);
		return ans;
	}
};

const int N = 1e6 + 47;
VI pos[2 * N][3];
Fenwick fn[2 * N][3];
int dp[N];
int cnt[N][3];

void solve()
{
	string s;
	cin >> s;
	int n = SZ(s);
	dp[0] = 1;
	map<char, int> m;
	m['I'] = 0;
	m['C'] = 1;
	m['P'] = 2;
	FOR(i, 0, n)
	{
		cnt[i + 1][m[s[i]]] = 1;
	}
	FOR(i, 0, n)
	{
		cnt[i + 1][0] += cnt[i][0];
		cnt[i + 1][1] += cnt[i][1];
		cnt[i + 1][2] += cnt[i][2];
	}
	FOR(i, 0, n + 1)
	{
		FOR (c1, 0, 3)
		{
			FOR(c2, c1 + 1, 3)
			{
				int x = cnt[i][c1] - cnt[i][c2] + N;
				int k = i - 3 * cnt[i][c1];
				pos[x][c1 + c2 - 1].PB(k);
			}
		}
	}
	FOR(i, 0, 2 * N) FOR(t, 0, 3)
	{
		sort(ALL(pos[i][t]));
		fn[i][t].init(SZ(pos[i][t]));
	}
	FOR(i, 0, n + 1)
	{
		FOR(c1, 0, 3)
		{
			FOR(c2, c1 + 1, 3)
			{
				int x = cnt[i][c1] - cnt[i][c2] + N;
				int k = i - 3 * cnt[i][c1];
				int j = upper_bound(ALL(pos[x][c1 + c2 - 1]), k) - pos[x][c1 + c2 - 1].begin() - 1;
				add(dp[i], fn[x][c1 + c2 - 1].get(j - 1));
			}
		}
		
		FOR(c1, 0, 3)
		{
			FOR(c2, c1 + 1, 3)
			{
				int x = cnt[i][c1] - cnt[i][c2] + N;
				int k = i - 3 * cnt[i][c1];
				int j = upper_bound(ALL(pos[x][c1 + c2 - 1]), k) - pos[x][c1 + c2 - 1].begin() - 1;
				fn[x][c1 + c2 - 1].inc(j, dp[i]);
			}
		}				
	}
	cout << dp[n] << '\n';
}

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

	solve();
	return 0;
}