#include <bits/stdc++.h>

using namespace std;

#define ll long long
const int INF=1e9,MOD=998244353;
const ll LINF=1e18;
#define fi first
#define se second
#define pii pair<int,int>
#define mid ((l+r)/2)
#define sz(a) (int((a).size()))
#define all(a) a.begin(),a.end()
#define endl "\n"
#define pb push_back

void PRINT(int x) {cerr << x;}
void PRINT(ll x) {cerr << x;}
void PRINT(double x) {cerr << x;}
void PRINT(char x) {cerr << '\'' << x << '\'';}
void PRINT(string x) {cerr << '\"' << x << '\"';}
void PRINT(bool x) {cerr << (x ? "true" : "false");}

template<typename T,typename V>
void PRINT(pair<T,V>& x){
    cerr<<"{";
    PRINT(x.fi);
    cerr<<",";
    PRINT(x.se);
    cerr<<"}";
}
template<typename T>
void PRINT(T &x){
    int id=0;
    cerr<<"{";
    for(auto _i:x){
        cerr<<(id++ ? "," : "");
        PRINT(_i);
    }
    cerr<<"}";
}
void _PRINT(){
    cerr<<"]\n";
}
template<typename Head,typename... Tail>
void _PRINT(Head h,Tail... t){
    PRINT(h);
    if(sizeof...(t)) cerr<<", ";
    _PRINT(t...);
}

#define Debug(x...) cerr<<"["<<#x<<"]=["; _PRINT(x)

const int mxN=1e6;

ll dp[3][mxN+1];
int I[mxN+1],C[mxN+1],P[mxN+1]; //IC IP CP
vector<int> vals[3][2*mxN+1];
vector<ll> seg[3][2*mxN+1];

void Md(ll& x){
    if(x>=MOD) x%=MOD;
}

void Update(int node,int l,int r,int idx,ll val,int d,int raz){
    if(l==r){
        seg[d][raz][node]+=val;
        return;
    }
    if(idx<=mid) Update(2*node,l,mid,idx,val,d,raz);
    else Update(2*node+1,mid+1,r,idx,val,d,raz);
    seg[d][raz][node]=seg[d][raz][2*node]+seg[d][raz][2*node+1];
}

ll Query(int node,int l,int r,int L,int R,int d,int raz){
    if(L>R) return 0;
    if(L<=l && r<=R) return seg[d][raz][node];
    ll ret=0;
    if(L<=mid) ret+=Query(2*node,l,mid,L,R,d,raz);
    if(R>mid) ret+=Query(2*node+1,mid+1,r,L,R,d,raz);
    return ret;
}

void Solve(){
    string S; cin>>S;
    int N=sz(S);
    S="$"+S;
    for(int i=1;i<=N;i++){
        I[i]=I[i-1]+(S[i]=='I');
        C[i]=C[i-1]+(S[i]=='C');
        P[i]=P[i-1]+(S[i]=='P');
    }
    for(int i=0;i<=N;i++){
        vals[0][I[i]-C[i]+N].pb(3*P[i]-i);
        vals[1][I[i]-P[i]+N].pb(3*C[i]-i);
        vals[2][C[i]-P[i]+N].pb(3*I[i]-i);
    }
    for(int d:{0,1,2}){
        for(int r=0;r<=2*N;r++){
            sort(all(vals[d][r]));
            vals[d][r].resize(unique(all(vals[d][r]))-vals[d][r].begin());
            seg[d][r].resize(4*sz(vals[d][r])+1);
        }
    }
    for(int i=0;i<=N;i++){
        if(i==0){
            int id0=lower_bound(all(vals[0][N]),0)-vals[0][N].begin();
            Update(1,0,sz(vals[0][N])-1,id0,1,0,N);

            int id1=lower_bound(all(vals[1][N]),0)-vals[1][N].begin();
            Update(1,0,sz(vals[1][N])-1,id1,1,1,N);

            int id2=lower_bound(all(vals[2][N]),0)-vals[2][N].begin();
            Update(1,0,sz(vals[2][N])-1,id2,1,2,N);
        }
        else{
            int r0=I[i]-C[i]+N;
            int c0=3*P[i]-i;
            int id0=lower_bound(all(vals[0][r0]),c0)-vals[0][r0].begin();
            dp[0][i]=Query(1,0,sz(vals[0][r0])-1,0,id0-1,0,r0);
            Md(dp[0][i]);

            int r1=I[i]-P[i]+N;
            int c1=3*C[i]-i;
            int id1=lower_bound(all(vals[1][r1]),c1)-vals[1][r1].begin();
            dp[1][i]=Query(1,0,sz(vals[1][r1])-1,0,id1-1,1,r1);
            Md(dp[1][i]);

            int r2=C[i]-P[i]+N;
            int c2=3*I[i]-i;
            int id2=lower_bound(all(vals[2][r2]),c2)-vals[2][r2].begin();
            dp[2][i]=Query(1,0,sz(vals[2][r2])-1,0,id2-1,2,r2);
            Md(dp[2][i]);

            ll tot=0;
            tot+=dp[0][i]; Md(tot);
            tot+=dp[1][i]; Md(tot);
            tot+=dp[2][i]; Md(tot);

            if(i==N){
                cout<<tot<<endl;
                return;
            }

            Update(1,0,sz(vals[0][r0])-1,id0,tot,0,r0);
            Update(1,0,sz(vals[1][r1])-1,id1,tot,1,r1);
            Update(1,0,sz(vals[2][r2])-1,id2,tot,2,r2);
        }
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t; t=1;
    //cin>>t;
    while(t--){
        Solve();
    }
    return 0;
}