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 Python (3.4.3) (judge verdict: Accepted)

N = int(input())
strings = []
for i in range(N):
    strings.append(input())
ans = 0
acount = 0
bcount = 0
abcount = 0
for i in range(N):
    for j in range(len(strings[i])-1):
        if strings[i][j:j+2] == "AB":
            ans += 1
    if strings[i][0] == "B" and strings[i][-1] == "A":
        abcount += 1
    elif strings[i][0] == "B":
        bcount += 1
    elif strings[i][-1] == "A":
        acount += 1

if abcount > 0:
    ans += abcount-1
    if acount > 0:
        ans += 1
        acount -= 1
    if bcount > 0:
        ans += 1
        bcount -= 1
    ans += min(acount, bcount)
else:
    ans += min(acount, bcount)
print(ans)