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())

A_count = B_count = BA_count = 0

ans = 0
for i in range(N):
    line = raw_input().strip()

    if line[0] == 'B':
        B_count += 1
        if line[-1] == 'A':
            BA_count += 1
            A_count += 1
    else:
        if line[-1] == 'A':
            A_count += 1

    for j in range(len(line)-1):
        if line[j:j+2] == 'AB':
            ans += 1


if A_count != 0 and B_count != 0:
    if A_count == B_count:
        ans += A_count
        if B_count == BA_count:
            ans -= 1
    elif A_count > B_count:
        ans += B_count
    else:
        ans += A_count

print(ans)