Problem Statement

You are given a string $S$ consisting of the three characters A, B, and C.

Define an operation as follows:

Choose a tuple $(i, j, k)$ satisfying $1 \le i \lt j \lt k \le |S|$, $S_i =$ A, $S_j =$ B, and $S_k =$ C, and remove the $i$-th, $j$-th, and $k$-th characters from $S$. The remaining characters are packed to the left in their original order.

Find the maximum number of times the operation can be performed on string $S$.

Constraints

• $1 \le |S| \le 10^{6}$
• $S$ is a string consisting of A, B, and C.

Input

The input is given from Standard Input in the following format:

S

Output

Output the answer.