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())
s = []
B_A = []
__A = []
B__ = []
abin = []

for i in range(n):
    si = input()
    s.append(si)
    c = 0
    if si[0] == "B":
        if si[len(si)-1] == "A":
            B_A.append(i)
        else:
            B__.append(i)
    else:
        if si[len(si)-1] == "A":
            __A.append(i)
    for j in range(1,len(si)):
        if si[j]== "B" and si[j-1] == "A":
            c += 1
    abin.append(c)

a = len(__A)
b = len(B__)
ab = len(B_A)
ans = sum(abin)

if ab > 0:
    renketu = ab
    if a > 0:
        renketu += 1
        a -= 1
    if b > 0:
        renketu += 1
        b -= 1
    renketu -= 1
else:
    renketu = 0

renketu += min(a,b)
    

print(ans + renketu)