Problem C
Majstor

Rock-paper-scissors is a popular two-player game. In the game, each of the players uses their hand to show one of three symbols: rock, paper or scissors. If both players show the same symbol, the game is a tie. Otherwise, scissors beat paper, paper beats rock and rock beats scissors.

Sven has been studying the psychological intricacies of the game for years and has become a real master at the game, his friends not standing a chance against him in one-on-one games.

With the world championships around the corner, Sven is practicing his skills playing simultaneous games with $N$ of his friends. One such game consists of $R$ rounds. In each round, Sven and each of his friends show one of the three symbols.

When calculating the score, in each round, Sven’s symbol is independently compared to each of his friends’ symbols. Sven scores two points for every win and one point for every tie. Sven does not get points for losing.

Write a program that calculates Sven’s total score, and also his largest possible score had he known in advance all the symbols his friends would show.

Input

The first line contains the integer $R$ ($1 \le R \le 50$), the number of rounds played.

The second line contains a string of $R$ letters ‘S’, ‘P’ or ‘R’. The string represents symbols that Sven showed in each round. ‘S’ is for scissors, ‘P’ for paper, ‘R’ for rock.

The third line contains the integer $N$ ($1 \le N \le 50$), the number of friends.

Each of the following $N$ lines contains a string of $R$ letters ‘S’, ‘P’ or ‘R’. These are the symbols shown by each of the $N$ friends in each of the $R$ rounds.

Output

Output Sven’s actual score on the first line.

Output his largest possible score on the second line, assuming his friends didn’t change their symbols.

5
SSPPR
1
SSPPR

5
10

5
SSPPR
2
PPRRS
RRSSP

10
15

4
SPRS
4
RPRP
SRRR
SSPR
PSPS

12
21