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=[]
cnt=0
B,A,BA=0,0,0
for i in range(n):
    s=input()
    cnt+=s.count("AB")
    if s[0]=="B"and s[-1]=="A":BA+=1
    elif s[0]=="B":B+=1
    elif s[-1]=="A":A+=1
if BA==0:print(cnt+min(A,B))
else:print(cnt+BA-1+(B>0)+(A>0)+max(0,min(A-1,B-1)))