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())
a,b,ba=0,0,0
ret = 0
for i in range(N):
  st = input()
  ret+=st.count('AB')
  if st[0]=='B' and st[-1]=='A':
    ba+=1
  elif st[0]=='B':
    b+=1
  elif st[-1]=='A':
    a+=1
if ba>0:
  ret+=ba-1
  if a>0 and b>0:
    ret+=2
    ret+=min(a-1,b-1)
  elif a==0 and b==0:
    ret+=0
  else:
    ret+=1
else:
  ret+=min(a,b)
print(ret)
