Peter has lined up hay bales. Some hay bales contain parasites and he wants to move the infected hay bales to the back of the sequence, to minimize the chance that the parasites spread. To sort the haybales, he repeatedly takes out any three consecutive hay bales and puts them back in sorted order. Your task is to calculate the minimum number of operations Peter has to execute to sort the sequence.

입력 형식

The input contains a single string s (3 ≤ |s| ≤ 500), the sequence of hay bales. Each character of s is either ‘C’ (for a clean hay bale) or ‘P’ (for an infected one).

출력 형식

The output must contain one integer, the minimum number of steps Peter has to execute.

예제 입력 1

CPCC

예제 출력 1

1

예제 입력 2

PPPPCCCC

예제 출력 2

8

예제 입력 3

CCCCPPPP

예제 출력 3

0