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())
c = 0
A = 0
B = 0
BA = 0
for i in range(N):
  tmp = input()
  if (tmp[0] == 'B') & (tmp[-1] == 'A'):
    BA += 1
  elif (tmp[0] == 'B'):
    B += 1
  elif (tmp[-1] == 'A'):
    A += 1 
  c += tmp.count('AB')
if BA >= 1:
  c += BA-1
  if B >= 1:
    B -=1
    c += 1
  if A >= 1:
    A -= 1
    c += 1
c += min(A,B)
print(c)