#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(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, map<int, int>> diag, hori, vert;

    diag[0][0] = 0;
    hori[0][0] = 0;
    vert[0][0] = 0;
        
    int x = 0, y = 0, yn = 0;

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

        yn = y - x;

        diag[yn][-x] = 0;
        hori[y][x] = 0;
        vert[x][y] = 0;
    }

    FT dft(s.size() + 1),  hft(s.size() + 1), vft(s.size() + 1);

    int ind = 0;

    for(auto dset : diag)
        for(auto dentry : dset.second)
            diag[dset.first][dentry.first] = ind++;
    
    ind = 0;

    for(auto dset : hori)
        for(auto dentry : dset.second)
            hori[dset.first][dentry.first] = ind++;

    ind = 0;

    for(auto dset : vert)
        for(auto dentry : dset.second)
            vert[dset.first][dentry.first] = ind++;

    dft.update(diag[0][0], 1);
    hft.update(hori[0][0], 1);
    vft.update(vert[0][0], 1);

    x = 0, y = 0, yn = 0;

    ll val = 0;

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

        yn = y - x;
        val = 0;

        val += dft.query(diag[yn][-x]) - dft.query(diag[yn].begin()->second);

        //cout << "VAL1: " << val << "\n";

        val += hft.query(hori[y][x]) - hft.query(hori[y].begin()->second);

        //cout << "VAL2: " << val << "\n";

        val += vft.query(vert[x][y]) - vft.query(vert[x].begin()->second);

        //cout << "VAL3: " << val << "\n";

        val %= mod;

        if(val < 0)
            val += mod;

        dft.update(diag[yn][-x], val);
        hft.update(hori[y][x], val);
        vft.update(vert[x][y], val);
    }

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