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: Accepted)

N = int(input())
S = []
g1 = []
g2 = []
g3 = []

ans = 0
for _ in range(N):
    s = input()
    ans += s.count("AB")
    if s[0] == 'B' and s[-1] == 'A':
        g1.append(s)
    if s[0] == 'B' and s[-1] != 'A':
        g2.append(s)
    if s[0] != 'B' and s[-1] == 'A':
        g3.append(s)


# g1が存在しない = B* と *A の組を作る
if len(g1) == 0:
    ans += min(len(g2), len(g3))
    print(ans)

# B*A が存在する場合
else:
    if len(g2) + len(g3) == 0:
        # B*A しか存在しない場合，これをくっつける
        ans += len(g1) - 1
    else:
        # B*A がlen(g1)個
        # B*  がlen(g2)個
        # *A  がlen(g3)個 ある
        # -> *A B*A B* の形を作れるだけ作る
        ans += len(g1) + min(len(g2), len(g3))
        pass
    print(ans)