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 = 'from collections import Counter\nimport sys\nsys.setrecursionlimit(10**6)\n\nMOD = 998244353\n\nABC = "abc".index\n*S, = map(ABC, input())\nN = len(S)\n\ndef bruteforce(S):\n    used = set()\n    def dfs(s):\n        key = tuple(s)\n        if key in used:\n            return\n        used.add(key)\n        for i in range(len(s)-1):\n            if s[i] != s[i+1]:\n                a = s[i]; b = s[i+1]\n                s[i] = s[i+1] = 3 - a - b\n                dfs(s)\n                s[i] = a; s[i+1] = b\n    dfs(S)\n    return len(used)\n\nif len(S) <= 3:\n    print(bruteforce(S))\nelse:\n    c = Counter(S)\n    if c[0] == N or c[1] == N or c[2] == N:\n        print(1)\n    else:\n        P = [[[0,0] for i in range(3)] for j in range(3)]\n        Q = [[[0,0] for i in range(3)] for j in range(3)]\n        P[0][0][0] = P[1][1][0] = P[2][2][0] = 1\n        for i in range(N-1):\n            for p in range(3):\n                for q in range(3):\n                    for r in range(2):\n                        Q[p][q][r] = 0\n            for p in range(3):\n                for q in range(3):\n                    for r in range(2):\n                        for k in range(3):\n                            Q[k][(q+k)%3][r | (p == k)] += P[p][q][r] % MOD\n            P, Q = Q, P\n        ans = 0\n        r = sum(S) % 3\n        for i in range(3):\n            ans += P[i][r][1]\n        if all(S[i] != S[i+1] for i in range(N-1)):\n            ans += 1\n        print(ans % MOD)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14489