Problem:
Score : 400 points

Problem Statement

Snuke has N strings. The i-th string is s_i.

Let us concatenate these strings into one string after arranging them in some order.
Find the maximum possible number of occurrences of AB in the resulting string.

Constraints

1 \leq N \leq 10^{4}

2 \leq |s_i| \leq 10

s_i consists of uppercase English letters.

Input

Input is given from Standard Input in the following format:

N
s_1
\vdots
s_N

Output

Print the answer.

Sample Input 1

3
ABCA
XBAZ
BAD

Sample Output 1

2

For example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.

Sample Input 2

9
BEWPVCRWH
ZZNQYIJX
BAVREA
PA
HJMYITEOX
BCJHMRMNK
BP
QVFABZ
PRGKSPUNA

Sample Output 2

4

Sample Input 3

7
RABYBBE
JOZ
BMHQUVA
BPA
ISU
MCMABAOBHZ
SZMEHMA

Sample Output 3

4

Solution in PHP (5.6.30) (judge verdict: Runtime Error)

<?php
fscanf(STDIN,"%d",$n);
for($z=0;$z<$n;$z++){
fscanf(STDIN,"%s",$s[$z]);
}
$count=0;
$firsta=0;
$endb=0;
for($i=0;$i<$n;$i++){
$count+=mb_substr_count($s[$i],"AB");
if(substr($s[$i],0,1)=="B")$endb+=1;
if(substr($s[$i],-1,1)=="A")$firsta+=1;

}
$ab=$firsta;
if($firsta-$endb>0)$ab=$endb;
echo($count+$ab);
?>