Problem:
Score : 100 points

Problem Statement

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.

Find the maximum number of consecutive rainy days in this period.

Constraints

|S| = 3

Each character of S is S or R.

Input

Input is given from Standard Input in the following format:

S

Output

Print the maximum number of consecutive rainy days in the period.

Sample Input 1

RRS

Sample Output 1

2

We 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.

Sample Input 2

SSS

Sample Output 2

0

It was sunny throughout the period. We had no rainy days, so we should print 0.

Sample Input 3

RSR

Sample Output 3

1

We had rain on the 1-st and 3-rd days - two "streaks" of one rainy day, so we should print 1.

Solution in C (GCC 9.2.1) (judge verdict: Accepted)

# include <stdio.h>

int count_rainy(char* weather);

int main(){
  char weather[4];
  int count_num = 0;
  scanf("%s", weather);
  count_num = count_rainy(weather);
  printf("%d\n", count_num);
  return 0;
}

int count_rainy(char* weather){
  int count_num = 0;
  for (int i=0; i<3; i++){
    if (weather[i] != 'a' && weather[i] !='b'){
      if (weather[i] == 'S') weather[i] = 'a';
      else {
        weather[i] = 'b';
        count_num = 1 + count_rainy(weather);
        if (count_num == 2) if (weather[1] == 'a') count_num = 1;
      }
    }
  }
  return count_num;
}