{"problem":{"name":"Normalization","description":{"content":"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 $99824435","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc094_d"},"statements":[{"statement_type":"Markdown","content":"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$:\n\n*   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`).\n\n## Constraints\n\n*   $2 \\leq |S| \\leq 2 × 10^5$\n*   $S$ consists of `a`, `b` and `c`.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc094_d","tags":[],"sample_group":[["abc","3\n\n`abc`, `aaa` and `ccc` can be obtained."],["abbac","65"],["babacabac","6310"],["ababacbcacbacacbcbbcbbacbaccacbacbacba","148010497"]],"created_at":"2026-03-03 11:01:14"}}