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 solve(s):\n    if all(a == b for a, b in zip(s, s[1:])):\n        return 1\n    if len(s) == 2:\n        return 2\n    elif len(s) == 3:\n        if s[0] == s[1] or s[1] == s[2]:\n            return 6\n        elif s[0] == s[2]:\n            return 7\n        else:\n            return 3\n    # dp[has succession=0][mod 3][last char], dp[has succession=1][mod 3]\n    dp = [[[0] * 3 for _ in range(3)], [0] * 3]\n    dp[0][0][0] = 1\n    dp[0][1][1] = 1\n    dp[0][2][2] = 1\n    MOD = 998244353\n    for _ in range(len(s) - 1):\n        ndp = [[[0] * 3 for _ in range(3)], [0] * 3]\n        dp0, dp1 = dp\n        ndp0, ndp1 = ndp\n        sdp1 = sum(dp1)\n        ndp0[0][0] = (dp0[0][1] + dp0[0][2]) % MOD\n        ndp0[1][0] = (dp0[1][1] + dp0[1][2]) % MOD\n        ndp0[2][0] = (dp0[2][1] + dp0[2][2]) % MOD\n        ndp0[0][1] = (dp0[2][0] + dp0[2][2]) % MOD\n        ndp0[1][1] = (dp0[0][0] + dp0[0][2]) % MOD\n        ndp0[2][1] = (dp0[1][0] + dp0[1][2]) % MOD\n        ndp0[0][2] = (dp0[1][0] + dp0[1][1]) % MOD\n        ndp0[1][2] = (dp0[2][0] + dp0[2][1]) % MOD\n        ndp0[2][2] = (dp0[0][0] + dp0[0][1]) % MOD\n        ndp1[0] = (dp0[0][0] + dp0[1][2] + dp0[2][1] + sdp1) % MOD\n        ndp1[1] = (dp0[1][0] + dp0[2][2] + dp0[0][1] + sdp1) % MOD\n        ndp1[2] = (dp0[2][0] + dp0[0][2] + dp0[1][1] + sdp1) % MOD\n        dp = ndp\n    return (dp[1][sum(map(ord, s)) % 3] + all(a != b for a, b in zip(s, s[1:]))) % MOD\n\n\ns = input()\nprint((solve(s)))\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 12933