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 = []
ans = 0
for i in range(N):
    si = input()
    s.append(si)

    ans += si.count("AB")




d = {}
d["A"] = 0
d["B"] = 0
d["all"] = 0

for i in range(N):
    if s[i][0] == "B" and s[i][-1] == "A":
        d["all"] += 1
    elif s[i][0] == "B":
        d["B"] += 1
    elif s[i][-1] == "A":
        d["A"] += 1


c = min(d["A"],d["B"],d["all"])
ans += (c*2)
d["A"] -= c
d["B"] -= c
d["all"] -= c

if d["all"] == 0:
    ans += min(d["A"],d["B"])
elif d["A"] == 0 and d["B"] == 0:
    ans += d["all"] // 2
elif d["A"] == 0:
    if d["B"] >= d["all"]*2:
        ans += 2*min(d["all"]//2,d["B"])
    else:
        ans += 2*min(d["all"]//2,d["B"])
        d["all"] -= 2*min(d["all"]//2,d["B"])
        ans += d["all"] // 2

elif d["B"] == 0:
    if d["A"] >= d["all"]*2:
        ans += 2*min(d["all"]//2,d["A"])
    else:
        ans += 2*min(d["all"]//2,d["A"])
        d["all"] -= 2*min(d["all"]//2,d["A"])
        ans += d["all"] // 2



print(ans)