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 = [input() for _ in range(n)]
counter = 0
startWithB = 0
endWithA = 0
both = 0


for i in range(n):
    counter += s[i].count("AB")
    if s[i][0] == "B":
        if s[i][-1] == "A":
            both += 1
        else:
            startWithB += 1
    elif s[i][-1] == "A":
        endWithA += 1

print(counter, startWithB, endWithA, both)

dif = abs(startWithB - endWithA)
if dif > both:
    print(min(startWithB + both, endWithA + both)+counter)
else:
    print(max(startWithB, endWithA) + both - dif + counter)