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 (3.4.3) (judge verdict: Accepted)

N=int(input())

if N==1:
    print(input().count("AB"))
    exit()

BA=0
B_=0
_A=0
cnt=0

for i in range(N):
    s=input()

    if s[0] == "B" and s[-1] == "A":
        BA += 1
    elif s[0] == "B" and s[-1] != "A":
        B_ += 1
    elif s[-1] != "B" and s[-1] == "A":
        _A += 1

    cnt += s.count("AB")


if _A==0 and B_==0:
    ans=max(0,BA-1)+cnt
elif (_A!=0 and B_==0) or (_A==0 and B_!=0):
    ans=BA+cnt

else:
    ans=BA+1+min(_A-1,B_-1)+cnt

print(ans)