#pragma GCC optimize("Ofast,unroll-loops,inline")
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define endl '\n'
#define all(x) x.begin(),x.end()
#define pll pair<ll,ll>
#define open(name) if(fopen(name".inp", "r")){freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
using namespace std;
const int maxN=1e6+5;
const int mod=998244353;
const int base=311;
int n,dp[maxN];
int cnt[maxN][3];
ll w[256];
string s;
void dnc(ll l,ll r){
    if(l==r)return;
    ll mid=l+r>>1;
    dnc(l,mid);
    for(int large=0;large<3;large++){
        for(int x=0;x<3;x++)if(x!=large){
            int y=3-large-x;
            if(x<y)continue;
            vector<pair<pair<int,int>,int>> v;
            for(int i=l;i<=mid;i++)v.pb({{cnt[i][y]-cnt[i][x],cnt[i][large]-cnt[i][x]},dp[i]});
            sort(all(v));
            for(int i=1;i<v.size();i++)if(v[i].first.first==v[i-1].first.first){
                v[i].second+=v[i-1].second;
                if(v[i].second>=mod)v[i].second-=mod;
            }
            for(int i=mid+1;i<=r;i++){
                pair<int,int> p={cnt[i][y]-cnt[i][x],cnt[i][large]-cnt[i][x]};
                auto z=upper_bound(all(v),make_pair(p,-1));
                if(z!=v.begin()){
                    z--;
                    if((*z).first.first==p.first){
                        dp[i]+=(*z).second;
                        if(dp[i]>=mod)dp[i]-=mod;
                    }
                }
            }
        }
    }
    for(int i=mid+1;i<=r;i++)dp[i]%=mod;
    dnc(mid+1,r);
}
void Enter(){
    cin>>s;
    n=s.size();
    s=' '+s;
    w['P']=0;
    w['C']=1;
    w['I']=2;
    for(int i=1;i<=n;i++){
        for(int j=0;j<3;j++)cnt[i][j]=cnt[i-1][j];
        cnt[i][w[s[i]]]++;
    }
    dp[0]=1;
    dnc(0,n);
    cout<<dp[n];
}
//amogus
signed main(){
    //open("tbrackets");
    cin.tie(nullptr);ios_base::sync_with_stdio(NULL);
    //int t=1;cin>>t;while(t--)
    Enter();
}