You are given a string S consisting of a,b and c. Find the number of strings that can be possibly obtained by repeatedly performing the following operation zero or more times, modulo 998244353:
 - Choose an integer i such that 1\leq i\leq |S|-1 and the i-th and (i+1)-th characters in S are different. Replace each of the i-th and (i+1)-th characters in S with the character that differs from both of them (among a, b and c).

-----Constraints-----
 - 2 \leq |S| \leq 2 × 10^5
 - S consists of a, b and c.

-----Input-----
Input is given from Standard Input in the following format:
S

-----Output-----
Print the number of strings that can be possibly obtained by repeatedly performing the operation, modulo 998244353.

-----Sample Input-----
abc

-----Sample Output-----
3

abc, aaa and ccc can be obtained.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'def main():\n    md = 998244353\n    s = input()\n    n = len(s)\n    if s.count(s[0]) == n:\n        print((1))\n        return\n    if n == 2:\n        print((2))\n        return\n    if n == 3:\n        if s[0] == s[-1]:\n            print((7))\n        elif s[0] == s[1] or s[1] == s[2]:\n            print((6))\n        else:\n            print((3))\n        return\n    ord0 = ord("a")\n    a = [ord(c) - ord0 for c in s]\n    r = sum(a) % 3\n    dp = [[[[0] * 3 for _ in range(2)] for _ in range(3)] for _ in range(n)]\n    for m in range(3):\n        dp[0][m][0][m] = 1\n    # print(a)\n    # print(dp)\n    for i in range(n - 1):\n        for j in range(3):\n            for k in range(2):\n                for m in range(3):\n                    pre = dp[i][j][k][m]  # iけた j余り k連続有無 m前の位\n                    for nm in range(3):\n                        nj = (j + nm) % 3\n                        if nm == m:\n                            dp[i + 1][nj][1][nm] = (dp[i + 1][nj][1][nm] + pre) % md\n                        else:\n                            dp[i + 1][nj][k][nm] = (dp[i + 1][nj][k][nm] + pre) % md\n    d = 1\n    for c0, c1 in zip(s, s[1:]):\n        if c0 == c1:\n            d = 0\n            break\n    print(((sum(dp[n - 1][r][1]) + d) % md))\n\nmain()\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14607