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 i in range(N)]
count=0
countA=0
countB=0
countB_A=0
for s in S:
    countA+=s[0]=="B"
    countB+=s[-1]=="A"
    countB_A+=s[0]=="B" and s[-1]=="A"
    for i in range(len(s)-1):
        count+=s[i]+s[i+1]=="AB"
if countA==countB==countB_A and countB_A:
    count-=1
print(count+min(countA,countB))
