#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+10,mod=998244353;
int n;
char s[N];
int a[N];
ll dp[N];

int sum[3][N];

map<int,vector<ll>> mp[3];
map<int,vector<ll>> tr[3];
map<int,map<int,int>> lsh[3];


int lowbit(int x){
    return x&-x;
}

void add(int u,int v,int x,ll c){
    for(int i=x;i<tr[u][v].size();i+=lowbit(i)){
        tr[u][v][i]+=c;
        tr[u][v][i]%=mod;
    }
}

ll query(int u,int v,int x){
    ll sum=0;
    for(int i=x;i>0;i-=lowbit(i)){
        sum=(sum+tr[u][v][i])%mod;
    }
    return sum;
}

int main(){
    scanf("%s",s+1);
    n=strlen(s+1);
    for(int i=1;i<=n;i++){
        if(s[i]=='I') a[i]=0;
        else if(s[i]=='P') a[i]=1;
        else a[i]=2;
    }
    for(int i=1;i<=n;i++){
        sum[a[i]][i]=1;
        for(int j=0;j<3;j++) sum[j][i]+=sum[j][i-1];
    }
    for(int i=0;i<=n;i++){
        // cout<<i<<endl;
        mp[0][sum[0][i]-sum[1][i]].push_back(sum[2][i]-sum[0][i]);
        mp[1][sum[0][i]-sum[2][i]].push_back(sum[1][i]-sum[0][i]);
        mp[2][sum[1][i]-sum[2][i]].push_back(sum[0][i]-sum[1][i]);
    }
    for(int i=0;i<3;i++){
        for(auto [x,y]:mp[i]){
            // cout<<x<<endl;
            sort(y.begin(),y.end());
            y.erase(unique(y.begin(),y.end()),y.end());

            for(int j=0;j<y.size();j++){

                //  cout<<y[j]<<" ";
                 lsh[i][x][y[j]]=j+1;
            }
            // cout<<endl;
            for(int j=0;j<=y.size();j++) tr[i][x].push_back(0);

        }
        // mp[i].clear();
    }
    dp[0]=1;
    add(0,0,lsh[0][0][0],1);
    add(1,0,lsh[1][0][0],1);
    add(2,0,lsh[2][0][0],1);
    for(int i=1;i<=n;i++){
        // cout<<i<<endl;
        int c01=sum[0][i]-sum[1][i];
        int c02=sum[0][i]-sum[2][i];
        int c12=sum[1][i]-sum[2][i];
        int c20=sum[2][i]-sum[0][i];
        int c10=sum[1][i]-sum[0][i];
        
        {
            ll res=query(0,c01,lsh[0][c01][c20]-1)+mod;
            // cout<<res%mod<<" ";
            dp[i]=(dp[i]+res)%mod;
        }

        {
            ll res=query(1,c02,lsh[1][c02][c10]-1)+mod;
            // cout<<res%mod<<" ";
            dp[i]=(dp[i]+res)%mod;
        }

        {
            ll res=query(2,c12,lsh[2][c12][c01]-1)+mod;
            // cout<<res%mod<<endl;
            dp[i]=(dp[i]+res)%mod;
        }
        add(0,c01,lsh[0][c01][c20],dp[i]);
        add(1,c02,lsh[1][c02][c10],dp[i]);
        add(2,c12,lsh[2][c12][c01],dp[i]);
    }

    cout<<dp[n]<<endl;
}