Problem Statement

Takahashi recorded the weather for $N$ consecutive days, recording each day as "sunny" or "rainy". His record is given as a string $S$ of length $N$ in the following format.

• The $i$-th character ( $1 \le i \le N$ ) of $S$ represents the weather on the $i$-th day from the start of the record.
  • If the $i$-th character of $S$ is S, the record for that day was "sunny".
  • If the $i$-th character of $S$ is R, the record for that day was "rainy".

Find the maximum number of consecutive days for which Takahashi recorded "rainy". If Takahashi never recorded "rainy", the answer is $0$.

Constraints

• $N$ is an integer satisfying $1 \le N \le 100$.
• $S$ is a string of length $N$ consisting of S and R.

Input

The input is given from Standard Input in the following format:

• $N$
• $S$

Output

Output the answer.

7
RRSRRRS

3

Starting from the first day, Takahashi recorded rainy, rainy, sunny, rainy, rainy, rainy, sunny. "Rainy" was recorded consecutively on days $4,5,6$, and there is no longer consecutive run of "rainy", so the maximum number of consecutive days with "rainy" recorded is $3$.

10
SSSSSSSSSS

0

Takahashi never recorded "rainy". In this case, the answer is $0$.

20
RRRSRRRRSSRRRRSRSRRR

4

• Source: AtCoder ABC 479 B