No 3 Equal

You have a string $S$ of length $N$ consisting of lower case English characters. You say that a string is good if there is **no** index $i$ such that $1 \le i \le N - 2$ and $S_i = S_{i + 1} = S_{i + 2}$. Find the minimum number of edits you need to make to the string to make it good. Each edit is changing one character to any other lower case English character. ### Input - The first line of i