#include <bits/stdc++.h>

#define maxn 1000005
#define mod 998244353

using namespace std;

int n;
char s[maxn];
int a[3][maxn];

int f[maxn];
void $(int &x, int y) {
	if ((x += y) >= mod) x -= mod;
}

struct node {
	int x, y;
	bool operator < (node a) {
		return y == a.y ? x < a.x : y < a.y;
	}
	bool operator == (node a) {
		return x == a.x && y == a.y;
	}
}nd[maxn << 3];

int tot;
int bg[maxn << 3];

int t[3][maxn << 3];
void add(int t[], int x, int k, int f) {
//	cout<<"Add:"<<x<<" "<<k<<" "<<f<<endl;
	x = lower_bound(nd + 1, nd + tot + 1, (node){x, k}) - nd;
	for (; x <= n * 6; x += x & -x) $(t[x], f);
}
int qry(int t[], int x, int k) {
//	cout<<"Qry:"<<x<<" "<<k<<endl;
	x = lower_bound(nd + 1, nd + tot + 1, (node){x, k}) - nd;
	k = bg[x];
	int res = 0;
	for (; x; x -= x & -x) $(res, t[x]);
	for (--k; k; k -= k & -k) $(res, mod - t[k]);
	return res;
}

int main() {
	scanf("%s", s + 1);
	n = strlen(s + 1);
	f[0] = 1;
	
	nd[++tot] = {0, 0};
	
	for (int i = 1; i <= n; i++) {
		a[0][i] = a[0][i - 1] + (s[i] == 'C');
		a[1][i] = a[1][i - 1] + (s[i] == 'I');
		a[2][i] = a[2][i - 1] + (s[i] == 'P');
		
//		cout<<a[0][i]<<" "<<a[1][i]<<" "<<a[2][i]<<endl;
		nd[++tot] = {a[0][i] - a[1][i] - 1, a[1][i] - a[2][i]};
		nd[++tot] = {a[1][i] - a[0][i] - 1, a[0][i] - a[2][i]};
		nd[++tot] = {a[2][i] - a[0][i] - 1, a[0][i] - a[1][i]};
		nd[++tot] = {a[0][i] - a[1][i], a[1][i] - a[2][i]};
		nd[++tot] = {a[1][i] - a[0][i], a[0][i] - a[2][i]};
		nd[++tot] = {a[2][i] - a[0][i], a[0][i] - a[1][i]};
	}
	
	sort(nd + 1, nd + tot + 1);
	tot = unique(nd + 1, nd + tot + 1) - nd - 1;
	for (int i = 1; i <= tot; i++) {
		if (i == 1 || nd[i].y != nd[i - 1].y) bg[i] = i;
		else bg[i] = bg[i - 1];
	}
//	for (int )
	
	add(t[0], 0, 0, 1);
	add(t[1], 0, 0, 1);
	add(t[2], 0, 0, 1);
	
	for (int i = 1; i <= n; i++) {
		$(f[i], qry(t[0], a[0][i] - a[1][i] - 1, a[1][i] - a[2][i]));
		$(f[i], qry(t[1], a[1][i] - a[0][i] - 1, a[0][i] - a[2][i]));
		$(f[i], qry(t[2], a[2][i] - a[0][i] - 1, a[0][i] - a[1][i]));
		
		add(t[0], a[0][i] - a[1][i], a[1][i] - a[2][i], f[i]);
		add(t[1], a[1][i] - a[0][i], a[0][i] - a[2][i], f[i]);
		add(t[2], a[2][i] - a[0][i], a[0][i] - a[1][i], f[i]);
		
//		cout<<f[i]<<endl;
	}
	printf("%d\n", f[n]);
	return 0;
}