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.

Examples

Input

3
ABCA
XBAZ
BAD


Output

2


Input

9
BEWPVCRWH
ZZNQYIJX
BAVREA
PA
HJMYITEOX
BCJHMRMNK
BP
QVFABZ
PRGKSPUNA


Output

4


Input

7
RABYBBE
JOZ
BMHQUVA
BPA
ISU
MCMABAOBHZ
SZMEHMA


Output

4
N = int(input())
S = [input() for _ in range(N)]

n_AB = sum([s.count("AB") for s in S])
n_endA = 0
n_beginB = 0
flg = True

for s in S:
    if s[0] == 'B': n_beginB += 1
    if s[-1] == 'A': n_endA += 1
    if (s[0] == 'B') ^ (s[-1] == 'A'):
        flg = False
        
n_joined =  min(n_endA, n_beginB) - flg

print(n_AB + max(0, n_joined))