Problem Statement

You are given a string $S$ of length $N$ consisting of A,R,C.

As long as $S$ contains three consecutive characters that are ARC, you can perform the operation below.

• In an odd-numbered ($1$-st, $3$-rd, $5$-th, ...) operation, choose in $S$ three consecutive characters that are ARC, and replace them with R.
• In an even-numbered ($2$-nd, $4$-th, $6$-th, ...) operation, choose in $S$ three consecutive characters that are ARC, and replace them with AC.

Find the maximum number of operations that can be performed.

Constraints

• $1 \leq N \leq 2\times 10^5$
• $S$ is a string of length $N$ consisting of A,R,C.

Input

Input is given from Standard Input in the following format:

N
S

Output

Print the answer.