#include <bits/stdc++.h>
#define ll long long
#define MAXN 1000010
#define MOD 998244353
using namespace std;
struct bit
{
    vector<ll> sum;
    void Init(ll sz)
    {
        sum.resize(sz+2);
    }
    void Add(ll pos,ll val)
    {
        for (ll i=pos;i<sum.size();i+=i&(-i))
            sum[i]=(sum[i]+val)%MOD;
    }
    ll Calc(ll pos)
    {
        ll ans=0;
        for (ll i=pos;i>0;i-=i&(-i))
            ans=(ans+sum[i])%MOD;
        return ans;
    }
};
map<ll,set<ll> > ic,cp,pi;
map<ll,bit> cntic,cntcp,cntpi;
map<ll,vector<ll> > posp,posi,posc;
ll prefi[MAXN],prefc[MAXN],prefp[MAXN],dp[MAXN];
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    string s;
    cin >> s;
    ll n=s.size();
    s=' '+s;
    ic[0].insert(LLONG_MIN);
    cp[0].insert(LLONG_MIN);
    pi[0].insert(LLONG_MIN);
    for (ll i=1;i<=n;i++)
    {
        prefi[i]=prefi[i-1];
        prefc[i]=prefc[i-1];
        prefp[i]=prefp[i-1];
        if (s[i]=='I')
            prefi[i]++;
        else if (s[i]=='C')
            prefc[i]++;
        else
            prefp[i]++;
        ic[prefi[i]-prefc[i]].insert(3*prefp[i]-i+1);
        cp[prefc[i]-prefp[i]].insert(3*prefi[i]-i+1);
        pi[prefp[i]-prefi[i]].insert(3*prefc[i]-i+1);
    }
    for (auto i : ic)
    {
        for (auto j : i.second)
            posp[i.first].push_back(j);
        cntic[i.first].Init(i.second.size());
    }
    for (auto i : cp)
    {
        for (auto j : i.second)
            posi[i.first].push_back(j);
        cntcp[i.first].Init(i.second.size());
    }
    for (auto i : pi)
    {
        for (auto j : i.second)
            posc[i.first].push_back(j);
        cntpi[i.first].Init(i.second.size());
    }
    for (int i=1;i<=n;i++)
    {
        auto it=lower_bound(posp[prefi[i]-prefc[i]].begin(),posp[prefi[i]-prefc[i]].end(),3*prefp[i]-i+1);
        ll pp=it-posp[prefi[i]-prefc[i]].begin()+1;
        it=lower_bound(posi[prefc[i]-prefp[i]].begin(),posi[prefc[i]-prefp[i]].end(),3*prefi[i]-i+1);
        ll pi=it-posi[prefc[i]-prefp[i]].begin()+1;
        it=lower_bound(posc[prefp[i]-prefi[i]].begin(),posc[prefp[i]-prefi[i]].end(),3*prefc[i]-i+1);
        ll pc=it-posc[prefp[i]-prefi[i]].begin()+1;
        dp[i]+=cntic[prefi[i]-prefc[i]].Calc(pp-1);
        dp[i]+=cntcp[prefc[i]-prefp[i]].Calc(pi-1);
        dp[i]+=cntpi[prefp[i]-prefi[i]].Calc(pc-1);
        if (prefi[i]==prefc[i] && prefp[i]>prefi[i])
            dp[i]++;
        else if (prefc[i]==prefp[i] && prefi[i]>prefc[i])
            dp[i]++;
        else if (prefp[i]==prefi[i] && prefc[i]>prefp[i])
            dp[i]++;
        cntic[prefi[i]-prefc[i]].Add(pp,dp[i]);
        cntcp[prefc[i]-prefp[i]].Add(pi,dp[i]);
        cntpi[prefp[i]-prefi[i]].Add(pc,dp[i]);
        dp[i]%=MOD;
    }
    cout << dp[n];
    return 0;
}