Problem:
Score : 600 points

Problem Statement

You are given a string s consisting of A, B and C.

Snuke wants to perform the following operation on s as many times as possible:

Choose a contiguous substring of s that reads ABC and replace it with BCA.

Find the maximum possible number of operations.

Constraints

1 \leq |s| \leq 200000

Each character of s is A, B and C.

Input

Input is given from Standard Input in the following format:

s

Output

Find the maximum possible number of operations.

Sample Input 1

ABCABC

Sample Output 1

3

You can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.

Sample Input 2

C

Sample Output 2

0

Sample Input 3

ABCACCBABCBCAABCB

Sample Output 3

6

Solution in Fortran (gfortran v4.8.4) (judge verdict: Wrong Answer)

program main
  implicit none
  integer(8) i, sosa, rensa, N
  character(200000) s 
  read(*, *) s
  N = len_trim(s)
  if (N < 3) then
    sosa = 0
  else
    sosa = 0
    rensa = 0
    do !while(i < N-2)
      if (s(i:i) == 'A') then
        rensa = rensa + 1
      else
        rensa = 0
      endif
      if (rensa > 0 .and. s(i+1:i+2) == 'BC') then
        sosa = sosa + rensa
        rensa = 0
        s(i+2:i+2) = 'A'
        i = i+2
      else
        i = i+1
      end if
      if (i > N-2) then
        exit
      end if
    end do
  end if
  write(* ,*) sosa
end program main