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 PyPy3 (2.4.0) (judge verdict: Wrong Answer)

N = int(input())
s = [input() for _ in [0]*N]
ni = [0]*N
for i,si in enumerate(s):
    for j,c in enumerate(si[:-1]):
        if c == "A" and si[j+1] == "B":
            ni[i] += 1
cntA,cntB,cntAB = 0,0,0
for si in s:
    if si[0]=="B" and si[-1]=="A":
        cntAB += 1
    elif si[0]=="B":
        cntB += 1
    elif si[-1]=="A":
        cntA += 1
ans = sum(ni) + cntAB + min(cntA,cntB) - (cntA==0 and cntB==0)
print(ans)