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 = []
ans = 0

b_head_a_tail = 0
b_head = 0
a_tail = 0

for _ in range(N):
    string= input()
    if string[0] == "B":
        if string[-1] == "A":
            b_head_a_tail += 1
        else:
            b_head += 1
    elif string[-1] == "A":
        a_tail += 1
    if "AB" in string:
        ans += 1
        
if b_head_a_tail > 0:
    if a_tail > 0:
        if b_head > 0:
            ans += b_head_a_tail  + min(a_tail, b_head) 
        else:
            ans += b_head_a_tail
    else:
        if b_head > 0:
            ans += b_head_a_tail
        else:
            ans += b_head_a_tail - 1
else:
    ans += min(a_tail, b_head) 
    
print(ans)