#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a, I = b; i <= I; ++i)
#define per(i, a, b) for (int i = a, I = b; i >= I; --i)
using namespace std;

using i64 = long long;
const int P = 998244353;
void add(int &x, int y) { (x += y) >= P && (x -= P); }
int Add(int x, int y) { return (x += y) >= P ? (x - P) : x; }
void sub(int &x, int y) { (x -= y) < 0 && (x += P); }
int Sub(int x, int y) { return (x -= y) < 0 ? (x + P) : x; }
void mul(int &x, int y) { x = 1ll * x * y % P; }
int Mul(int x, int y) { return 1ll * x * y % P; }
int power(int a, int b, int c = 1) {
    for (; b; b >>= 1, mul(a, a))
        if (b & 1) mul(c, a);
    return c;
}

const int N = 1000005;
int n, dp[N], sum[N][3], ord[3][N * 2];
char s[N];

struct DS {
    int n;
    vector<int> c, all;
    void push(int x) {
        all.push_back(x);
    }
    void init() {
        if (all.empty()) return;
        n = all.size();
        sort(all.begin(), all.end());
        c.assign(n + 1, 0);
    }
    int find(int x) {
        return lower_bound(all.begin(), all.end(), x) - all.begin() + 1;
    }
    void modify(int p, int x) {
        p = find(p);
        for (; p <= n; p += p & -p) add(c[p], x);
    }
    int query(int p) {
        p = find(p);
        int res = 0;
        for (--p; p; p -= p & -p) add(res, c[p]);
        return res;
    }
} tr[3][N * 2];

int main() {
	ios::sync_with_stdio(0), cin.tie(0);

    cin >> (s + 1), n = strlen(s + 1);
    rep(i, 1, n) {
        memcpy(sum[i], sum[i - 1], 12);
        sum[i][(s[i] == 'I') ? 0 : (s[i] == 'P' ? 1 : 2)] += 1;
        rep(j, 0, 2) ord[j][i] = sum[i][j] * 3 - i;
    }

    const int A[] = {1, 0, 0}, B[] = {2, 2, 1};
    rep(i, 0, n) {
        rep(j, 0, 2) {
            int id = sum[i][A[j]] - sum[i][B[j]] + n;
            tr[j][id].push(ord[j][i]);
        }
    }
    rep(j, 0, 2) rep(i, 0, 2 * n) tr[j][i].init();
    auto push = [&](int i) {
        rep(j, 0, 2) {
            int id = sum[i][A[j]] - sum[i][B[j]] + n;
            tr[j][id].modify(ord[j][i], dp[i]);
        }
    };
    auto query = [&](int i) {
        rep(j, 0, 2) {
            int id = sum[i][A[j]] - sum[i][B[j]] + n;
            add(dp[i], tr[j][id].query(ord[j][i]));
        }
    };

    dp[0] = 1, push(0);
    rep(i, 1, n) query(i), push(i);
    cout << dp[n] << "\n"; 

	return 0;
}