//Create Time: 2018-04-24 20:26:20
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <fstream>
#include <functional>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cctype>
#include <ctime>
#include <utility>
#include <complex>
#include <cassert>
#include <climits>
#include <iterator>
#include <tuple>
using namespace std;
#define snuke(i,x) for (__typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)
#define rep(i,a,n) for (int i=(a);i<(n);i++)
#define per(i,n,a) for (int i=(n)-1;i>=(a);i--)
// #define OUT(x) std::cout<<(#x)<<":"<<(x)<<std::endl
// #define TST(x) std::cout<<(#x)<<":"<<(x)<<" "
#define OUT(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("\n",_it,args);}
#define TST(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("",_it,args);}
#define SZ(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define unq(x) sort(all(x)),(x).erase(unique(all(x)),(x).end())
#define mem(f,x) memset((f), (x), sizeof(f))
#define clr(f) mem(f,0)
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define mt make_tuple
#define eb emplace_back
#define DEBUG
void OUT_TST(string s,istream_iterator<string> it) {cerr<<s;}
template<typename T, typename... Args> void OUT_TST(string s,istream_iterator<string> it,T a,Args... args){cerr<<*it<<"="<<a<<" ";OUT_TST(s,++it,args...);}
template<class T> void rd(T&ret){ret=0;bool ok=0,u=0;for(;;){int c=getchar();if(c>='0'&&c<='9')ret=(ret<<3)+(ret<<1)+c-'0',ok=1;else if(c=='-')u=1;else if(ok){if(u)ret*=-1;return;}}}
long long powmod(long long p,long long n,long long mod){long long ret=1;for(;n;n>>=1){if(n&1)ret=ret*p%mod;p=p*p%mod;}return ret;}
template <class T> bool chmin(T& a, const T &b) {return b < a? a = b, 1: 0;}
template <class T> bool chmax(T& a, const T &b) {return b > a? a = b, 1: 0;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii > vii;
/****head****/
const int mod=998244353;
const int N=(int)2e5+9;
void dfs(string s,set<string>& hs){
    if(hs.find(s)!=hs.end())return;
    hs.insert(s);
    auto get=[&](char a,char b){
        if(a>b)swap(a,b);
        if(a=='a'&&b=='b')return 'c';
        if(a=='a')return 'b';
        return 'a';
    };
    rep(i,0,SZ(s)-1)if(s[i]!=s[i+1]){
        char a=s[i],b=s[i+1],c=get(a,b);
        s[i]=s[i+1]=c;
        dfs(s,hs);
        s[i]=a;s[i+1]=b;
    }
}
int main(){
    string s;cin>>s;
    int n=SZ(s);
    if(n<=3){
        set<string> hs;
        dfs(s,hs);
        cout<<SZ(hs)<<endl;
        return 0;
    } 
    bool sm=0,all=1;
    int mo=0;
    rep(i,0,n)mo+=s[i]-'a';mo%=3;
    rep(i,0,n-1){
        if(s[i]==s[i+1])sm=1;
        if(s[i]!=s[i+1])all=0;
    }
    OUT(mo,sm,all);
    if(all){puts("1");return 0;}
    static int dp[N][3][3][2]; // first i, end j, mod = k, is_same=t
    mem(dp,0);
    rep(x,0,3)dp[0][x][x][0]=1;
    rep(i,0,n-1)rep(j,0,3)rep(k,0,3)rep(t,0,2)if(dp[i][j][k][t]){
        rep(x,0,3){
            (dp[i+1][x][(k+x)%3][t|(x==j)]+=dp[i][j][k][t])%=mod;
        }
    }

    ll ans=0;
    if(!sm)++ans;
    // rep(i,0,3)if(mo==i*n%3)++ans;
    rep(i,0,3){
        ans+=dp[n-1][i][mo][1];
    }
    cout<<ans%mod<<endl;
    return 0;
}


Measured memory_bytes: 14596