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())
sl = [input() for _ in range(n)]

c = 0
ca = 0
cb = 0
cab = 0

for s in sl:
  c += s.count('AB')
  if s[-1] == 'A':
    ca += 1
  if s[0] == 'B':
    cb += 1
  if s[-1] == 'A' and s[0] == 'B':
    cab += 1

t = min(ca, cb)
if ca == cb and cb == cab and ca > 0:
  t -= 1
print(c + t)
