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 Java (OpenJDK 11.0.6) (judge verdict: Accepted)

import java.util.Scanner;

// 提出時にclass Main に書き換え
public class Main {
	public static void main(String[] args)  {
		// 標準入力を受け取る
		Scanner sc = new Scanner(System.in);
		String S = sc.nextLine(); // String Sを受け取る
		sc.close(); // 標準入力を終了



		int r = 0; // 連続した雨の日数
		int rm = 0; // 連続した雨の日数(最大値)

		while(S.length() > 0) {
			if(S.startsWith("R")) {
				r += 1; // 連続した雨の日数を加算
			} else {
				r = 0; // 連続した雨の日数を加算
			}
			// 最大値更新
			if(r > rm) {rm = r;}
			// Sの先頭の文字を消去
			S = removeLeadingZeroes(S);
		}
		System.out.println(rm);
	}

	// 文字列の先頭を削除するメソッド
	static String removeLeadingZeroes(String s) {
	    StringBuilder sb = new StringBuilder(s);
	    if (sb.length() > 0) {
	        sb.deleteCharAt(0);
	    }
	    return sb.toString();
	}

}