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: Wrong Answer)

N = int(input())
s = []
for i in range(N):
    s.append(input())
count = 0
bcount = 0
acount = 0
bacount = 0
for j in s:
    count += j.count("AB")
    if j[0] == "B" and j[-1] == "A":
        bacount += 1
    elif j[0] == "B":
        bcount += 1
    elif j[-1] == "A":
        acount += 1

if min(bcount,acount) <= bacount:
    count += min(bcount,acount)*2
    bacount -= min(bcount,acount)
    acount -= min(bcount,acount)
    bcount -= min(bcount,acount)
    if bacount > 0:
        count += (acount+bcount+bacount)
else:
    count += min(bcount,acount) + bacount


print(count)