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())
L=[input() for i in range(N)]
c=[0,0,0]
ans=0
for st in L:
  ans+=st.count("AB")
  if st[-1]=="A":
    if st[0]=="B":
      c[0]+=1
    else:
      c[1]+=1
  elif st [0]=="B":
    c[2]+=1
if c[0]!=0:
  ans+=c[0]-1
  if c[1]!=0:
    ans+=1
    c[1]-=1
  if c[2]!=0:
    ans+=1
    c[2]-=1
ans+=min(c[1:])
print(ans)