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 PyPy3 (2.4.0) (judge verdict: Wrong Answer)

n=int(input())
ab=0
a=[0]*n
b=[0]*n
for i in range(n):
  s=input()
  ab+=s.count("AB")
  if(s[0]=='B'):
    b[i]=1
  if(s[-1]=='A'):
    a[i]=1
c=0
a1=a
b1=b
for i in range(n):
  for j in range(n):
    if(i!=j and b[i]==1 and a[j]==1):
      a[i]=0
      b[i]=0
      c+=1
      break
d=0
for i in range(n):
  for j in range(n):
    if(i!=j and a1[i]==1 and b1[j]==1):
      a1[i]=0
      b1[i]=0
      d+=1
      break
print(ab+max(c,d))