#include <bits/stdc++.h>
using namespace std;

#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 998244353
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1

#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\t" << b << endl
#define p3(a, b, c) idp cout << a << "\t" << b << "\t" << c << endl
#define p4(a, b, c, d) idp cout << a << "\t" << b << "\t" << c << "\t" << d << endl
#define p5(a, b, c, d, e) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << endl
#define p6(a, b, c, d, e, f) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << endl
#define p7(a, b, c, d, e, f, g) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << endl
#define p8(a, b, c, d, e, f, g, h) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << "\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << "\t" << h << "\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << "\t" << h << "\t" << i << "\t" << j << endl
#define foreach(it, v) for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n)                         \
    idp                                    \
    {                                      \
        rep(i, n) { cout << x[i] << " "; } \
        puts("");                          \
    }
#define dump2(x, n)                                                     \
    idp                                                                 \
    {                                                                   \
        rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; } \
        puts("");                                                       \
    }
#define dumpi(x)                  \
    idp                           \
    {                             \
        foreach (it, x)           \
        {                         \
            cout << (*it) << " "; \
        }                         \
        puts("");                 \
    }
#define dumpi2(x)                                               \
    idp                                                         \
    {                                                           \
        foreach (it, x)                                         \
        {                                                       \
            cout << "[" << (it)->F << " , " << (it)->S << "] "; \
        }                                                       \
        puts("");                                               \
    }

#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h)                   \
    rep(i, h)                             \
    {                                     \
        rep(j, w) cout << a[i][j] << " "; \
        puts("");                         \
    }

typedef pair<li, li> PI;

li dp[200200][3][3];


li inv3 = 332748118;

inline li calc(li n, li amari) {
    li fact3 = 1;
    rin{
        fact3 = (fact3 * 3) % MOD;
    }
    // dp[i][j][k] : i文字目がjでかつ全体のあまりがkになるときの場合の数
    rep(j, 3)rep(k, 3)dp[0][j][k] = 0;
    dp[0][0][0] = 1;
    dp[0][1][1] = 1;
    dp[0][2][2] = 1;

    repp(i, 1, n) {
        rep(j, 3) {
            rep(k, 3) {
                dp[i][j][k] = 0;
                rep(l, 3) {
                    if (j != l) {
                        dp[i][j][k] = (dp[i][j][k] + dp[i - 1][l][(k + 3 - j) % 3]) % MOD;
                    }
                }
            }
        }
    }
    li opp = (dp[n - 1][0][amari] + dp[n - 1][1][amari] + dp[n - 1][2][amari]) % MOD;
    return (fact3 * inv3 - opp + MOD) % MOD;
}

int main() {
    string s;
    cin >> s;
    li n = sz(s);
    bool all_different = true;
    bool all_same = true;

    li amari = 0;

    rep(i, n) {
        if (i < n - 1) {
            if (s[i] == s[i + 1]) {
                all_different = false;
            } else {
                all_same = false;
            }
        }
        amari += s[i] - 'a';
    }
    amari %= 3;

    if (all_same) {
        puts("1");
        return 0;
    }

    if (n == 2) {
        cout << (all_different ? 2 : 1) << endl;
        return 0;
    }

    if (n == 3) {
        auto ss = s;
        sort(allof(ss));
        if (ss == "abc") {
            puts("3");
            return 0;
        } else if (s[0] == s[1] || s[1] == s[2]) {
            puts("6");
            return 0;
        } else {
            puts("7");
            return 0;
        }
    }

    cout << calc(n, amari) + (all_different ? 1 : 0) << endl;

    return 0;
}

Measured memory_bytes: 14596