Problem:
Score : 400 points

Problem Statement

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.

Sample Input 1

3
ABCA
XBAZ
BAD

Sample Output 1

2

For example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.

Sample Input 2

9
BEWPVCRWH
ZZNQYIJX
BAVREA
PA
HJMYITEOX
BCJHMRMNK
BP
QVFABZ
PRGKSPUNA

Sample Output 2

4

Sample Input 3

7
RABYBBE
JOZ
BMHQUVA
BPA
ISU
MCMABAOBHZ
SZMEHMA

Sample Output 3

4

Solution in Python (2.7.6) (judge verdict: Runtime Error)

N=int(input())
l=[]
for i in range(N):
    l.append(input())
cnt=cnt_a=cnt_b=count=0
for i in l:
    cnt=cnt+i.count('AB')
    if i[0]=='B' and i[-1]=='A':count+=1
    if i[0]=='B' and i[-1]!='A':cnt_b+=1
    if i[-1]=='A' and i[0]!='B':cnt_a+=1
if N==count:print (cnt+N-1)
else:print (cnt+count+min(cnt_a,cnt_b))