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 = []
for i in range(N):
    s.append(input())
A = 0
B = 0
BA = 0
inAB = 0
for i in range(N):
    if s[i][-1] == "A" and s[i][0] == "B":
        BA += 1
    elif s[i][-1] == "A":
        A += 1
    elif s[i][0] == "B":
        B += 1
    inAB += s[i].count("AB")

if A == B and A == 0 and BA != 0: BA -= 1
print(min(A+BA,B+BA)+inAB)