FNASHA
------
Jebediah is organizing the Leutonian Fnasha Contest.  (This sport of 
Fnasha is a cross between badminton and ice hockey, except is played 
with a live bird instead of a plastic badminton birdie.)  

During the contest, each player will take 25 shots on an empty net.  
Each shot is either successful or missed.  The winner of the contest 
will be the player with the most *consecutive* successes during his 
or her 25 shots.  Ties are broken in an extremely complicated way
that you probably shouldn't even worry about.

For example, suppose Yosh and Stan have the following sequences of successes
(S) and misses (M) during their 25 shots.

Yosh:  SSSMSSMMMMSMMSSSSSMMMSSSS
Stan:  SSSSMSSSSMSSSSMSSSSMSSSSM

Then Yosh wins because he had 5 successful shots in a row, whereas 
Stan never had more than 4 successful shots in a row.

Given the sequences of scores of the various players, your task is
to output the largest number of consecutive successes each player had,
so that the winner of the contest can be determined (or whether a tie-
breaker is required).

INPUT
-----
The first line of input will give a positive integer n.  Then there
will be n lines, with each line containing a sequence of 25 characters.
Each character will be either S or M.

OUTPUT
------
For each line of input produce one line of output giving the largest
number of consecutive successes in the format shown in the sample output.

SAMPLE INPUT
------------
2
SSSMSSMMMMSMMSSSSSMMMSSSS
SSSSMSSSSMSSSSMSSSSMSSSSM

SAMPLE OUTPUT
-------------
Player 1: 5
Player 2: 4