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())
ans = 0
c1, c2, c3 = 0, 0, 0
for i in range(n):
    s = input()
    ans += s.count('AB')
    l = len(s)
    if (s[0] == 'B') & (s[l - 1] == 'A'):
        c3 += 1
    elif s[0] == 'B':
        c1 += 1
    elif s[l - 1] == 'A':
        c2 += 1
if (c1 == 0) & (c2 == 0):
    ans += max(0, c3 - 1)
else:
    ans += min(c1, c2) + c3
print(ans)