A train contains sleeping cars, marked with letter , and sitting cars, marked with letter . Find the biggest number of sleeping cars that follow each other in the train.
One line contains a sequence of letters and , with length from to characters.
Print the maximum number of seeping cars that follow each other.