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++ (Clang 10.0.0) (judge verdict: Accepted)

// #include <bits/stdc++.h>
#include <string>
#include <iostream>
using namespace std;
#define f(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define rf(i, a, b) for (int(i) = (a)-1; (i) >= (b); (i)--)
#define CLEAR(a) memset((a), 0, sizeof(a))
#define INF 1000000000
#define lli long long int
#define ull unsigned long long int
#define ALL(c) (c).begin(), (c).end()

#define mod 1000000007

int abs(int a, int b) { return a - b < 0 ? b - a : a - b; }
int main(void)
{
    // ios_base::sync_with_stdio(false);
    // cin.tie(NULL);
// #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
// #endif
    string s,s1="R",s2="RR",s3="RRR";
    cin >> s;
    int val = 0;
    if (s.find(s1) != string::npos) val=1;
    if (s.find(s2) != string::npos) val=2;
    if (s.find(s3) != string::npos) val=3;
    cout<<val;
    return 0;
}