#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define LC k<<1
#define RC k<<1|1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repn(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = (n) - 1; i >= a; i--)
#define pern(i, a, n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef pair<ull, ull> PUU;
typedef pair<LL, LL> PLL;

const int N = 1100000;
const int M = 3100000;
const int mod = 998244353;
const int inf = (int)1e9;
const LL INF = 1e18;
const double eps = 1e-9;

mt19937_64 Rand((unsigned long long)new char);
#define rand Rand

int n;
string s;
ull pri[M];
int sz[M], ls[M], rs[M], pos;
LL val[M], mn[M], mx[M], sum[M], data[M];
int newnode(LL v, LL x) {
	pos++;
	sz[pos] = 1, ls[pos] = rs[pos] = 0;
	val[pos] = mn[pos] = mx[pos] = v;
	data[pos] = sum[pos] = x;
	pri[pos] = rand();
	return pos;
}
int RANK(int x) {
	return sz[ls[x]] + 1;
}
void pushup(int x) {
	sz[x] = sz[ls[x]] + sz[rs[x]] + 1;
	mn[x] = mx[x] = val[x];
	sum[x] = (data[x] + sum[ls[x]] + sum[rs[x]]) % mod;
	if (ls[x]) mn[x] = min(mn[x], mn[ls[x]]), mx[x] = max(mx[x], mx[ls[x]]);
	if (rs[x]) mn[x] = min(mn[x], mn[rs[x]]), mx[x] = max(mx[x], mx[rs[x]]);
}

void pushdown(int x) {
}
// l: rk[x] < k; r: rk[x] >= k
void rsplit(int x, LL k, int &l, int &r) {
	if (!x) {
		l = r = 0;
		return;
	}
	pushdown(x);
	if (RANK(x) < k) l = x, rsplit(rs[x], k - RANK(x), rs[x], r);
	else r = x, rsplit(ls[x], k, l, ls[x]);
	pushup(x);
}
// l: val[x] < k; r: val[x] >= k
void vsplit(int x, LL k, int &l, int &r) {
	if (!x) {
		l = r = 0;
		return;
	}
	pushdown(x);
	if (val[x] < k) l = x, vsplit(rs[x], k, rs[x], r);
	else r = x, vsplit(ls[x], k, l, ls[x]);
	pushup(x);
}
// pre-condition: mx[x] <= mn[y]
int merge(int x, int y) {
	if (!x || !y) return x | y;
	pushdown(x), pushdown(y);
	assert(mx[x] <= mn[y]);
	if (pri[x] < pri[y]) {
		ls[y] = merge(x, ls[y]);
		pushup(y);
		return y;
	}
	else {
		rs[x] = merge(rs[x], y);
		pushup(x);
		return x;
	}
}
LL dp[N], ni[N], nc[N], np[N];
map<int, int> icp, cpi, pic;
int main() {
	IO;
	cin >> s;
	n = s.size();
	repn(i, 1, n) {
		ni[i] = ni[i - 1] + (s[i - 1] == 'I');
		nc[i] = nc[i - 1] + (s[i - 1] == 'C');
		np[i] = np[i - 1] + (s[i - 1] == 'P');
	}
	dp[0] = 1;
	icp[0] = merge(icp[0], newnode(0, 1));
	cpi[0] = merge(cpi[0], newnode(0, 1));
	pic[0] = merge(pic[0], newnode(0, 1));
	repn(i, 1, n) {
		int u, v, rt;
		LL res = 0;
		// icp
		vsplit(icp[ni[i] - nc[i]], ni[i] - np[i] + 1, u, v);
		res = (res + sum[v]) % mod;
		icp[ni[i] - nc[i]] = merge(u, v);
		// cpi
		vsplit(cpi[nc[i] - np[i]], nc[i] - ni[i] + 1, u, v);
		res = (res + sum[v]) % mod;
		cpi[nc[i] - np[i]] = merge(u, v);
		// pic
		vsplit(pic[np[i] - ni[i]], np[i] - nc[i] + 1, u, v);
		res = (res + sum[v]) % mod;
		pic[np[i] - ni[i]] = merge(u, v);
		
		dp[i] = res;
		
		// icp
		vsplit(icp[ni[i] - nc[i]], ni[i] - np[i] + 1, u, v);
		rt = merge(u, newnode(ni[i] - np[i], res));
		icp[ni[i] - nc[i]] = merge(rt, v);
		// cpi
		vsplit(cpi[nc[i] - np[i]], nc[i] - ni[i] + 1, u, v);
		rt = merge(u, newnode(nc[i] - ni[i], res));
		cpi[nc[i] - np[i]] = merge(rt, v);
		// pic
		vsplit(pic[np[i] - ni[i]], np[i] - nc[i] + 1, u, v);
		rt = merge(u, newnode(np[i] - nc[i], res));
		pic[np[i] - ni[i]] = merge(rt, v);
	}
	cout << dp[n] << "\n";
	return 0;
}