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 _ in [0]*N]
AB=0
X_A=0
B_X=0
B_A=0
for s in S:
    AB+=s.count("AB")
    if s[0]!="B" and s[-1]=="A":X_A+=1
    if s[0]=="B" and s[-1]!="A":B_X+=1
    if s[0]=="B" and s[-1]=="A":B_A+=1
r=AB
if B_A>0:
    r+=B_A-1
    if X_A>0:r+=1;X_A-=1
    if B_X>0:r+=1;B_X-=1
r+=min(X_A,B_X)
print(r)