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
import re

n = int(raw_input())

ab = 0
a = 0
b = 0

ans = 0
for i in range(0, n):
    s = raw_input()
    find_list = re.findall("AB", s)
    ans += len(find_list)

    if re.search("^B.*A$", s) is not None:
        ab += 1
        continue

    if re.search(".*A$", s) is not None:
        a += 1

    if re.search("^B.*", s) is not None:
        b += 1

if ab > 0:
    ans += ab - 1
    if a > 0:
        ans += 1
        a -= 1
    if b > 0:
        ans += 1
        b -= 1
    ans += min(a, b)

else:
    ans += min(a, b)

print(ans)
