A train consists of sleeping cars, denoted by the letter , and sitting cars, denoted by the letter . Find the maximum number of sleeping cars that are located consecutively in the train.
One line contains a sequence of the letters and , with length from to characters.
Print one integer — the maximum number of consecutive sleeping cars in the train.
Example 41