#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

const ll mod =  998244353;

struct FT {
    vector<ll> s;

    FT() : s(2000001) {}

    FT(int n) : s(n) {}

    void update(int pos, ll dif) { // a [ pos ] += d i f
        for (; pos < sz(s); pos |= pos + 1) s[pos] = (s[pos] + dif) % mod;
    }

    ll query(int pos) { // sum of values in [0 , pos)
        ll res = 0;

        for (; pos > 0; pos &= pos - 1) res = (res + s[pos-1]) % mod;

        return res;
    }
};

int main(){
    cin.tie(NULL)->sync_with_stdio(false);
    
    string s;
    cin >> s;

    map<int, FT> diag, hori, vert;

    diag.insert({1000000, FT(2000001)});
    hori.insert({1000000, FT(2000001)});
    vert.insert({1000000, FT(2000001)});

    diag[1000000].update(1000000, 1);
    hori[1000000].update(1000000, 1);
    vert[1000000].update(1000000, 1);

    int x = 1000000, y = 1000000, yn;
    ll val = 0;

    for(char c : s){
        if(c == 'I')
            y++;
        else if(c == 'C')
            x++;
        else{
            x--;
            y--;
        }

        yn = y - (x - 1000000);

        if(diag.find(yn) == diag.end())
            diag.insert({yn, FT(2000001)});
        
        if(hori.find(y) == hori.end())
            hori.insert({y, FT(2000001)});

        if(vert.find(x) == vert.end())
            vert.insert({x, FT(2000001)});

        val = diag[yn].query(2000001) + hori[y].query(x) + vert[x].query(y) - diag[yn].query(x + 1);
        
        diag[yn].update(x, val);
        hori[y].update(x, val);
        vert[x].update(y, val);

        //cout << val << "\n";
    }
    
    cout << val << "\n";
}