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 Fortran (GNU Fortran 9.2.1) (judge verdict: Accepted)

PROGRAM A
  IMPLICIT NONE
  CHARACTER(len=3) :: S
  CHARACTER(len=1) :: w1,w2,w3
  INTEGER :: i=0

  READ *, S
  w1 = S(1:1)
  w2 = S(2:2)
  w3 = S(3:3)

  IF (w1=="R") THEN
    i=i+1
    IF (w2==w1) THEN
      i=i+1
      IF (w3==w2) THEN
        i=i+1
      ELSE
      END IF
    ELSE
    END IF
  ELSE
    IF (w2=="R") THEN
      i=i+1
      IF (w3==w2) THEN
        i=i+1
      ELSE
      END IF
    ELSE
      IF (w3=="R") THEN
        i=i+1
      ELSE
      END IF
    END IF
  END IF

  PRINT *, i
END PROGRAM A