#include<bits/stdc++.h>
#define ll long long
using namespace std;
string S;
int N;
const int maxn=1e6+5;
const ll MOD=998244353;
struct modint{
   ll val=0;
   void fromll(ll a){
      val=a%MOD;
      return;
   }
   const modint operator + (const modint &x) const{
      modint ret;
      ret.val=val+x.val;
      if(ret.val>=MOD)
         ret.val-=MOD;
      return ret;
   };
   const modint operator - (const modint &x) const{
      modint ret;
      ret.val=val-x.val;
      if(ret.val<0)
         ret.val+=MOD;
      return ret;
   };
   const modint operator * (const modint &x) const{
      modint ret;
      ret.val=val*x.val%MOD;
      return ret;
   }
   const modint operator + (const ll &x)const{
      modint ret;
      ret.val=val+x;
      if(ret.val>=MOD)
         ret.val-=MOD;
      return ret;
   }
   const modint operator - (const ll &x)const{
      modint ret;
      ret.val=val-x;
      if(ret.val<0)
         ret.val+=MOD;
      return ret;
   }
   const modint operator * (const ll &x)const{
      modint ret;
      ret.val=val*x%MOD;
      return ret;
   }
};
modint dp[maxn];
struct slovo{
   int s1=0,s2=0,s3=0,L[2*maxn];
   modint fwt[maxn];
   vector<int> V[2*maxn];
   void ftadd(int pos,modint kol){
      for(int i=pos;i<=N;i+=i&(-i))
         fwt[i]=fwt[i]+kol;
      return;
   }
   modint get(int pos){
      modint ret;
      for(int i=pos;i>0;i-=i&(-i))
         ret=ret+fwt[i];
      return ret;
   }
   modint getint(int l,int r){
      modint ret=get(r);
      if(l>1)
         ret=ret-get(l-1);
      return ret;
   }
   void addprec(char x,int i){
      if(x=='A')
         s1++;
      if(x=='B')
         s2++;
      if(x=='C')
         s3++;
      V[s1-s2+N].push_back(3*s3-i);
   }
   void finishprec(){
      s1=s2=s3=0;
      L[2*N]=1;
      V[N].push_back(0);
      sort(V[2*N].begin(),V[2*N].end());
      for(int i=2*N-1;i>=0;i--){
         L[i]=L[i+1]+V[i+1].size();
         sort(V[i].begin(),V[i].end());
      }
      modint aaa;
      aaa.val=1;
      for(int i=0;i<V[N].size();i++)
         if(V[N][i]==0){
            ftadd(L[N]+i,aaa);
            break;
         }
   }
   void add(char x,int i){
      if(x=='A')
         s1++;
      if(x=='B')
         s2++;
      if(x=='C')
         s3++;
   }
   int findless(int idx,int val){
      if(V[idx].size()==0)
         return -1;
      if(V[idx][0]>=val)
         return -1;
      int dg=0,gg=V[idx].size()-1,sred,poz;
      while(dg<=gg){
         sred=(dg+gg)/2;
         if(V[idx][sred]<val){
            poz=sred;
            dg=sred+1;
         }
         else
            gg=sred-1;
      }
      return poz;
   }
   modint calc(int i){
      int val=3*s3-i-1;
      int p=s1-s2+N;
      modint ret;
      ret.val=0;
      int idx=findless(p,val);
   //   cout<<p<<" "<<idx<<" "<<L[p]<<" "<<L[p]+idx<<endl;
      if(idx==-1)
         return ret;
      return getint(L[p],L[p]+idx);
   }
   void newvalue(int i,modint val){
      int p=s1-s2+N;
      if(V[p].size()==0)
         return;
     // cout<<p<<" "<<V[p].size()<<" "<<L[p]<<" "<<L[p+1]<<endl;
      int v=3*s3-i;
      int idx=findless(p,v+1);
      ftadd(L[p]+idx,val);
      //cout<<"DODAJ FT "<<L[p]+idx<<" "<<val.val<<endl;
   }
} A,B,C;
char ta[130],tb[130],tc[130];
int main(){
   cin>>S;
   N=S.size();
   S="D"+S+"DDDD";
   for(int i=1;i<=N;i++){
      if(S[i]=='I')
         S[i]='A';
      if(S[i]=='P')
         S[i]='B';
   }


   ta['A']='C';
   ta['B']='B';
   ta['C']='A';
   tb['A']='A';
   tb['B']='C';
   tb['C']='B';
   tc['A']='A';
   tc['B']='B';
   tc['C']='C';


   for(int i=1;i<=N;i++){
      A.addprec(ta[S[i]],i);
      B.addprec(tb[S[i]],i);
      C.addprec(tc[S[i]],i);
   }
   A.finishprec();
   B.finishprec();
   C.finishprec();

   for(int i=1;i<=N;i++){
      A.add(ta[S[i]],i);
      B.add(tb[S[i]],i);
      C.add(tc[S[i]],i);

      dp[i]=dp[i]+A.calc(i);
     // cout<<dp[i].val<<" dp1\n";
      dp[i]=dp[i]+B.calc(i);
      //cout<<dp[i].val<<" dp2\n";
      dp[i]=dp[i]+C.calc(i);
      //cout<<dp[i].val<<" dp3"<<endl;
      A.newvalue(i,dp[i]);
      B.newvalue(i,dp[i]);
      C.newvalue(i,dp[i]);
   }
   //cout<<endl;

   cout<<dp[N].val<<"\n";
   return 0;
}
/*


ceil(i-j+1-C)/2 <C
A+B-C < 2*C
i-j+1 < 3*(p[i] - p[j])
i-j+1 < 3*p[i]-p[j]
i-3*p[i]+1 < j- 3*p[j]

3*p[i]-i-1 > 3*p[j]-j

*/