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 = [list(input()) for _ in range(n)]

cnt = 0
judge = 0
for i in range(n):
    for j in range(len(s[i])):
        if j != len(s[i]) - 1:
            if s[i][j] == "A":
                judge = 1
        if judge == 1 and s[i][j] != "A":
            if s[i][j] == "B":
                cnt += 1
                judge = 0
            else:
                judge = 0
        if j == len(s[i]) - 1:
            judge = 0
cnt_a = 0
cnt_b = 0
cnt_ab = 0

for i in range(n):
    len_s = len(s[i])
    if s[i][len_s - 1] == "A":
        cnt_a += 1
    if s[i][0] == "B":
        cnt_b += 1
    if s[i][0] == "B" and s[i][len_s - 1] == "A":
        cnt_ab += 1

if cnt_a == cnt_ab and cnt_a > 0:
    print(cnt + min(cnt_a, cnt_b) - 1)
else:
    print(cnt + min(cnt_a, cnt_b))