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: Runtime Error)

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		Integer n = sc.nextInt();

		if (n < 3) {
			System.out.println(0);
			return;
		}

		List<Long> l = new ArrayList<Long>();

		for (Integer i = 0; i < n; i++) {
			Long a = sc.nextLong();
			l.add(a);
		}

		Collections.sort(l);

		Integer count = 0;

		for (Integer i = 0; i < n - 2; i++) {
			for (Integer j = i + 1; j < n - 1; j++) {
				for (Integer k = j + 1; k < n; k++) {
					if (l.get(i) == l.get(j) || l.get(j) == l.get(k) || l.get(k) == l.get(i)) {
						continue;
					}
					if (l.get(k) < l.get(i) + l.get(j)) {
						count++;
					}
				}
			}
		}
		System.out.println(count);
	}
}