Sleeping cars#7326

Sleeping cars

1 second
128 megabytes
Very easy

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.

Input

One line contains a sequence of the letters and , with length from to characters.

Output

Print one integer — the maximum number of consecutive sleeping cars in the train.

Examples

Example 41

Loading
Loading