e-olymp
Competitions

Programming Principles 1. Week 6. October 7 - 13. PART 2

Sleeping cars

A train contains sleeping cars, marked with letter k, and sitting cars, marked with letter p. Find the biggest number of sleeping cars that follow each other in the train.

Input

One line contains a sequence of letters k and p, with length from 1 to 1000 characters.

Output

Print the maximum number of seeping cars that follow each other.

Time limit 1 second
Memory limit 122.17 MiB
Input example #41
kpkkp
Output example #41
2
Source 2014 ACM-ICPC Ukraine, 2nd Round Ukraine, September 13, Problem C