New theater just opened in Mirko's home town, and Mirko and Slavko naturally went to check it out. Opening projection was filled to the last place, and Mirko got mad because cup-holders at both sides of his seat were taken and he had nowhere to put his Coke.

A row in theater has ~N~ seats. There is a single cup-holder between adjacent seats, and also two additional cup-holders at both ends of the row. Exception to this are pairs of love seats - there is no cup-holder between them.

Your task is to help Mirko. Given sequence of letters describing seats in some row, and assuming that all seats are taken, find the maximum number of people that can put their cups in a cup-holder right next to their seat.

Letter S in the sequence denotes ordinary seat, and L denotes love seat. Love seats will always come in pairs of adjacent seats.

Diagram below corresponds to sequence SLLLLSSLL, with asterisks denoting cup-holders.

* S * L L * L L * S * S * L L *

For this example, at least two persons won't be able to put their cups into cup-holders.

Input Specification

The first line of input contains the integer ~N~ ~(1 \le N \le 50)~, number of seats in a row.

The following line contains a sequence of ~N~ letters L or S, describing the row as stated above.

Output Specification

The first and only line of output should contain the maximum number of people that can put their cups in cup-holder right next to them.

Sample Input 1

3
SSS

Sample Output 1

3

Sample Input 2

4
SLLS

Sample Output 2

4

Sample Input 3

9
SLLLLSSLL

Sample Output 3

7