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

A = 0
B = 0
AB = 0

cnt = 0 

for _ in range(N):
    Si = input()
    cnt += Si.count('AB')
    if Si[0] == 'B' and Si[-1] == 'A':
        AB += 1
    elif Si[0] == 'B':
        B += 1
    elif Si[-1] == 'A':
        A += 1

if AB > 1:
    cnt += AB -2 
    if A > 0:
        cnt += 1
        A -= 1
    if B > 0:
        cnt += 1
        B -= 1
    if A > B :
        cnt += B
    else:
        cnt += A
else: 
    if A > B :
        cnt += B
    else:
        cnt += A
print(cnt)