Normalization

AtCoder

IDarc094_d

Time2000ms

Memory256MB

Difficulty—

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$ [samples]

Samples

Input #1

abc

Output #1

3

`abc`, `aaa` and `ccc` can be obtained.

Input #2

abbac

Output #2

Input #3

babacabac

Output #3

Input #4

ababacbcacbacacbcbbcbbacbaccacbacbacba

Output #4

148010497

API Response (JSON)

{
  "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 $99824435...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments