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())
st=[0]*N
for i in range(N):
    st[i]=input()
ans=0
c1=0 #b_start,a_end
c2=0#b_start
c3=0#a_end
for i in st:
    ans+=i.count("AB")
    if i[0]=="B" and i[-1]=="A":
        c1+=1
    elif i[0]=="B":
        c2+=1
    elif i[-1]=="A":
        c3+=1
if c1==0:
    ans+=min(c2,c3)
elif c2+c3>0:
    ans=ans+c1+min(c2,c3)
else:
    ans=ans+c1-1
print(ans)