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())
ab = 0
bx = 0
xa = 0
bxa = 0

for ln in range(n):
    line = input().rstrip()
    ab += line.count("AB")
    first , last = line[0], line[-1]
    if (first, last) == ('B', 'A'):
        bxa += 1
    elif first == 'B':
        bx += 1
    elif last == 'A':
        xa += 1

if bx + xa == 0:
    bxa = max(0, bxa - 1)

print(ab + bxa + min(bx, xa))