#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define pb push_back
#define ALL(v) v.begin(), v.end()

const int MOD = 998244353;
const int oft = 1e6;
const int INF = 1e9;

int sum[1000005][3];
int num[256], msk[8];
int dp[1000005], cnt[2000005];
vector<int> buk[4000005];

void add(int &x, int val) {
    x += val;
    if (x >= MOD) x -= MOD;
}

void dq(int l, int r) {
    if (l == r) return;
    int mid = (l + r) >> 1;
    dq(l, mid);

    int idx[3] = {0, 1, 2};

    auto oracle = [&]() {
        int mi = INF, mx = -INF; 
        for (int i = l; i <= r; ++i) {
            mi = min(mi, sum[i][idx[2]] - sum[i][idx[0]]);
            mx = max(mx, sum[i][idx[2]] - sum[i][idx[0]]);
        }
        for (int i = r; i >= l; --i)
            buk[sum[i][idx[2]] - sum[i][idx[0]] - mi].pb(i);
        for (int i = 0; i <= mx - mi; ++i) {
            for (int j : buk[i]) {
                if (j <= mid) add(cnt[sum[j][idx[0]] - sum[j][idx[1]] + oft], dp[j]);
                else add(dp[j], cnt[sum[j][idx[0]] - sum[j][idx[1]] + oft]);
            }
            buk[i].clear();
        }
        for (int i = l; i <= mid; ++i)
            cnt[sum[i][idx[0]] - sum[i][idx[1]] + oft] = 0;
    };

    oracle();
    swap(idx[1], idx[2]);
    oracle();
    swap(idx[0], idx[2]);
    oracle();

    dq(mid + 1, r);
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    msk[0] = {-1};
    for (int i = 1; i < 8; ++i)
        msk[i] = -msk[i & (i - 1)];
    string s;
    cin >> s;
    num[int('I')] = 0, num[int('C')] = 1, num[int('P')] = 2;
    for (int i = 1; i <= SZ(s); ++i) {
        for (int j = 0; j < 3; ++j)
            sum[i][j] = sum[i - 1][j];
        ++sum[i][num[int(s[i - 1])]];
    }
    dp[0] = 1;
    dq(0, SZ(s));
    cout << dp[SZ(s)] << "\n";
}