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 main(void)
{
	char a[3];
	int i;
	for(i=0;i<3;i++)
	{
		scanf("%c",&a[i]);
	}
	
	int q,qq,qqq;
	q=0;qq=0;qqq=0;
	if(a[0]=='R')
	{
		if(a[1]=='R')
		{
			if(a[2]=='R')
			{
				q=3;
			}
			else
			{
				q=2;
			}
		}
		else
		{
			q=1;
		}
	}
	else if(a[1]=='R')
	{
		if(a[2]=='R')
		{
			qq=2;
		}
		else
		{
			qq=1;
		}
	}
	else if(a[2]=='R')
	{
		qqq=1;
	}
	else
	{
		;
	}
	
	int max=-1;
	if(max<q)
	{
		max=q;
	}
	if(max<qq)
	{
		max=qq;
	}
	if(max<qqq)
	{
		max=qqq;
	}
	printf("%d\n",max);
	
	return 0;
}