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())
s = [input() for i in range(N)]
flg = 1
cnt = 0
ca = 0
cb = 0
for i in range(N):
  if s[i][0] == 'B' and s[i][-1] == 'A':
    ca += 1
    cb += 1
  elif s[i][0] == 'B':
    cb += 1
    flg = 0
  elif s[i][-1] == 'A':
    ca += 1
    flg = 0
  cnt += s[i].count('AB')

if  min(ca, cb) > 0:
  cnt += min(ca, cb) - flg

print (cnt)

