Score : $300$ points
Given is a string $S$. Let $T$ be the concatenation of $K$ copies of $S$. We can repeatedly perform the following operation: choose a character in $T$ and replace it with a different character. Find the minimum number of operations required to satisfy the following condition: any two adjacent characters in $T$ are different.
Input is given from Standard Input in the following format:
Print the minimum number of operations required.
issiiissii. For example, we can rewrite it into
ispiqisyhi, and now any two adjacent characters are different.