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())

cnt = 0
l = 0
r = 0
b = 0
for i in range(N):
    s_i = input()
    cnt += s_i.count("AB")

    if s_i[0] == "B" and s_i[len(s_i) - 1] == "A":
        b += 1
    elif s_i[0] == "B":
        l += 1
    elif s_i[len(s_i) - 1] == "A":
        r += 1
    else:
        continue

p = min(l, r)
m = max(l, r)
rest = m - p

if b > 0:
    cnt += b - 1
if rest > 0:
    cnt += 1
cnt += p

print(cnt)