// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 998244353;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

char to_char(int i){
  return char(i + 'a');
}

int calc(string s){
  set<string> st;
  st.insert(s);
  function<void(string)> dfs = [&](string t){
    rep(i, sz(t) - 1){
      if(t[i] != t[i+1]){
        string u = t;
        char c = 'a';
        rep(j, 3){
          if(to_char(j) != t[i] && to_char(j) != t[i+1])c = to_char(j);
        }
        u[i] = c;
        u[i+1] = c;
        if(st.find(u) == st.end()){
          st.insert(u);
          dfs(u);
        }
      }
    }
  };
  dfs(s);
  return st.size();
}

ll dp[200001][3][3][2];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  string s;
  cin >> s;
  if(sz(s) < 4){
    cout << calc(s) << endl;
    return 0;
  }
  bool same = true;
  bool diff = true;
  rep(i, sz(s) - 1){
    if(s[i] != s[i+1])same = false;
    if(s[i] == s[i+1])diff = false;
  }
  if(same){
    cout << 1 << endl;
    return 0;
  }
  ll res = 0;
  if(diff)res++;
  int MOD = 0;
  rep(i, sz(s)){
    MOD += int(s[i] - 'a');
  }
  MOD %= 3;
  dp[1][0][0][0] = 1;
  dp[1][1][1][0] = 1;
  dp[1][2][2][0] = 1;
  FOR(i, 1, sz(s)){
    rep(j, 3){
      rep(k, 3){
        dp[i+1][j][k][1] = dp[i][(j-k+3)%3][k][0];
        rep(u, 3){
          if(u != k)(dp[i+1][j][k][0] += dp[i][(j-k+3)%3][u][0]) %= mod;
          (dp[i+1][j][k][1] += dp[i][(j-k+3)%3][u][1]) %= mod;
        }
      }
    }
  }
  rep(i, 3){
    (res += dp[sz(s)][MOD][i][1]) %= mod;
  }
  cout << res << endl;
  return 0;
}


Measured memory_bytes: 28692