{"raw_statement":[{"iden":"problem statement","content":"We have weather records at AtCoder Town for some consecutive three days. A string of length $3$, $S$, represents the records - if the $i$\\-th character is `S`, it means it was sunny on the $i$\\-th day; if that character is `R`, it means it was rainy on that day.\nFind the maximum number of consecutive rainy days in this period."},{"iden":"constraints","content":"*   $|S| = 3$\n*   Each character of $S$ is `S` or `R`."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"RRS"},{"iden":"sample output 1","content":"2\n\nWe had rain on the $1$\\-st and $2$\\-nd days in the period. Here, the maximum number of consecutive rainy days is $2$, so we should print $2$."},{"iden":"sample input 2","content":"SSS"},{"iden":"sample output 2","content":"0\n\nIt was sunny throughout the period. We had no rainy days, so we should print $0$."},{"iden":"sample input 3","content":"RSR"},{"iden":"sample output 3","content":"1\n\nWe had rain on the $1$\\-st and $3$\\-rd days - two \"streaks\" of one rainy day, so we should print $1$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}