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

ans = 0

x = y = z = 0
for _ in xrange(n):
    s = raw_input().strip()
    for i in xrange(len(s) - 1):
        if s[i] == 'A' and s[i + 1] == 'B': ans += 1

    if s[0] == 'B' and s[-1] == 'A': z += 1
    elif s[0] == 'B': y += 1
    elif s[-1] == 'A': x += 1

m = min(x, y)
ans += m + z

if x == 0 and y == 0:
    if z > 0: ans -= 1

ans = max(0, ans)
print ans