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.

Examples

Input

RRS


Output

2


Input

SSS


Output

0


Input

RSR


Output

1
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(){
    string s;cin>>s;
    int an=0,cur=0;
    for(char x:s){
        if(x=='R') cur++;
        else cur=0;
        an=max(an,cur);
    }cout<<an<<"\n";
}

