const int N = 400005;
const int LG = 21;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#include <deque>

using namespace std;

#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;

#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())

#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL

int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};

ll inq(ll x, ll y)
{
    if (!y) re 1 % MOD;
    ll l = inq(x, y / 2);
    if (y % 2) re l * l % MOD * x % MOD;
    re l * l % MOD;
}

ll rev(ll x)
{
    return inq(x, MOD - 2);
}

bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;

void __precompute_combinatorics()
{
    __precomputed_combinatorics = 1;
    __fact.resize(N);
    __ufact.resize(N);
    __rev.resize(N);
    __rev[1] = 1;
    for (int i = 2; i < N; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
    __fact[0] = 1, __ufact[0] = 1;
    for (int i = 1; i < N; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}

ll fact(int x)
{
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[x];
}

ll cnk(int n, int k)
{
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}

ll dp[N][3][3][2];
string s;

signed main()
{
    srand(time(NULL));
    #ifdef ONLINE_JUDGE
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
    #endif // ONLINE_JUDGE
    cin >> s;
    if (s.size() <= 3)
    {
        vector<string> q = {s};
        map<string, int> in;
        in[s] = 1;
        for (int i = 0; i < q.size(); i++)
        {
            string s = q[i];
            for (int j = 0; j + 1 < s.size(); j++)
            {
                string t = s;
                if (t[j] != t[j + 1])
                {
                    t[j] = 'a' + 'b' + 'c' - s[j] - s[j + 1];
                    t[j + 1] = 'a' + 'b' + 'c' - s[j] - s[j + 1];
                    if (in[t] == 0)
                    {
                        in[t] = 1;
                        q.push_back(t);
                    }
                }
            }
        }
        cout << q.size();
        return 0;
    }
    int tumbol = 1;
    for (int i = 0; i + 1 < s.size(); i++) if (s[i] == s[i + 1]) tumbol = 0;
    sort(all(s));
    if (s[0] == s.back()) cout << 1, exit(0);
    dp[1][0][0][0] = 1;
    dp[1][1][1][0] = 1;
    dp[1][2][2][0] = 1;
    for (int pos = 2; pos <= s.size(); pos++)
    {
        for (int here = 0; here < 3; here++)
        {
            for (int pr = 0; pr < 3; pr++)
            {
                for (int si = 0; si < 3; si++)
                {
                    if (here != pr) dp[pos][(si + here) % 3][here][0] = (dp[pos][(si + here) % 3][here][0] + dp[pos - 1][si][pr][0]) % MOD;
                    else dp[pos][(si + here) % 3][here][1] = (dp[pos][(si + here) % 3][here][1] + dp[pos - 1][si][pr][0]) % MOD;
                    dp[pos][(si + here) % 3][here][1] = (dp[pos][(si + here) % 3][here][1] + dp[pos - 1][si][pr][1]) % MOD;
                }
            }
        }
    }
    int ki = 0;
    for (int i = 0; i < s.size(); i++) ki += s[i] - '0';
    ki %= 3;
    cout << (tumbol + dp[s.size()][ki][0][1] + dp[s.size()][ki][1][1] + dp[s.size()][ki][2][1]) % MOD;
}

/* Note:
Check constants at the beginning of the code.
N is set to 4e5 but be careful in problems with large constant factor.
Check corner cases.
No def int long long for now.
*/


Measured memory_bytes: 29188