#include <bits/stdc++.h>

using namespace std;

const int O = 3e6 + 50;
const int mod = 998244353;
const int inf = 1e16;

int n, m, dem, c[O], f[O], dd[O], id[3][O], cnt[3][O];
vector <int> val[O];
string s;

void add(int &x, int y){
    x += y;
    if (x >= mod) x -= mod;
    if (x < 0) x += mod;
}

struct fenwick_tree{
    int N;
    vector <int> sum;

    void init(int x){
        N = x + 1;
        sum.assign(x + 1, 0);
    }

    void Add(int x, int a){
        //cout << "check " << N << endl;
        for(; x < N; x += x & -x){
            //cout << x << endl;
            add(sum[x], a);
        }
    }

    int get_sum(int x){
        int res = 0;
        for(; x > 0; x -= x & -x) add(res, sum[x]);
        return res;
    }
} tree[O];

main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> s; n = s.size(); s = " " + s;

    c['I'] = 0; c['P'] = 1; c['C'] = 2;

    for (int i = 1; i <= n; ++ i){
        for (int j = 0; j < 3; ++ j){
            cnt[j][i] = cnt[j][i - 1];
        }
        cnt[c[s[i]]][i] += 1;
    }

    for (int j = 0; j < 3; ++ j){
        int u = 0, v = 2;
        if (j == 0) u = 1;
        if (j == 2) v = 1;

        memset(dd, 0, sizeof(dd));

        for (int i = 0; i <= n; ++ i){
            int x = cnt[u][i] - cnt[v][i] + n;
            if (dd[x] == 0) dd[x] = ++ dem;
            id[j][i] = dd[x];
            val[id[j][i]].push_back(cnt[j][i] - cnt[u][i]);
        }
    }

    //tree.resize(dem + 1);
    for (int i = 1; i <= dem; ++ i){
        sort(val[i].begin(), val[i].end());
        m = unique(val[i].begin(), val[i].end()) - val[i].begin();
        val[i].resize(m);

        tree[i].init(m + 2);
    }

    //cout << val[1].size() << endl;

    //cout << n << endl;

    f[0] = 1;
    for (int i = 0; i <= n; ++ i){
        for (int j = 0; j < 3; ++ j){
            int u = 0, v = 2;
            if (j == 0) u = 1;
            if (j == 2) v = 1;

            int x = id[j][i];
            int vis = upper_bound(val[x].begin(), val[x].end(), cnt[j][i] - cnt[u][i]) - val[x].begin();
            add(f[i], tree[x].get_sum(vis - 1));
        }

        for (int j = 0; j < 3; ++ j){
            int u = 0, v = 2;
            if (j == 0) u = 1;
            if (j == 2) v = 1;

            int x = id[j][i];
            int vis = upper_bound(val[x].begin(), val[x].end(), cnt[j][i] - cnt[u][i]) - val[x].begin();
            //cout << i << " " << j << " " << x << " " << vis << endl;
            tree[x].Add(vis, f[i]);
        }
    }

    cout << f[n];
}
/***
***/