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
# coding: utf-8
# Your code here!
N=int(input())
cnt=0
ba=0
a=0
b=0

for i in range(N):
    chr=input()
    cnt+=chr.count('AB')
    if chr[0]=='B' and chr[-1]=='A':
        ba+=1
    elif chr[-1]=='A':
        a+=1
    elif chr[0]=='B':
        b+=1

if ba==0:
    cnt+=min(a,b)
elif a+b==0:
    cnt+=(ba-1)
else:
    cnt+=ba+min(a,b)
print(cnt)