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)]
a_c=0
b_c=0
ab_c=0
ans=0
for i in l:
   ans+=i.count("AB")
   if i[0] == "B" and i[-1] == "A":
      ab_c+=1
      continue
   if i[-1] == "A":
      a_c+=1
   if i[0] == "B":
      b_c+=1
ans+=max(ab_c-1,0)
if a_c > 0 and ab_c>0:
   a_c-=1
   ans+=1
if b_c > 0 and ab_c>0:
   b_c-=1
   ans+=1
ans+=min(a_c,b_c)
print(ans)