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 Python (3.8.2) (judge verdict: Wrong Answer)

user_input = input()
upper = user_input.upper()
store = []
for i in upper:
    store.append(i)
st_nd = store[0:2]
# print(st_nd)
nd_rd = store[1:3]
# print(nd_rd)
for i in set(store):
    if i == "S":
        rain = 0
if len(set(store)) == 1:
    for i in set(store):
        if i == "S":
            print("0")
        else:
            print("3")
elif len(set(st_nd)) == 1:
    print("2")
elif len(set(nd_rd)) == 1:
    print("2")
else:
    print("1")