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: Wrong Answer)

#include<stdio.h>
int main(void)
{
	int N,i,j,k,count=0;
	scanf("%d",&N);
	int L[N];
	for(i=0;i<N;i++){
		scanf("%d",&L[i]);
	}
	for(i=0;i<N-2;i++){
		for(j=i;j<N-1;j++){
			for(k=j;k<N;k++){
				if(L[i]==L[j] || L[j]==L[k] || L[k]==L[i])
					continue;
				else if(L[i]<L[j]+L[k] && L[j]<L[i]+L[k] && L[k]<L[i]+L[j])
				count++;
			}
		}
	}
	printf("%d",count);
	return 0;	
		
}