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: Wrong Answer)

from math import ceil
n=int(input())
s=[input() for i in range(n)]
cba=0
ca=0
cb=0
ans=0
for i in range(n):
  if s[i][0]=='B':
    if s[i][len(s[i])-1]=='A':
      cba+=1
    else:
      cb+=1
  if s[i][0]!='B' and s[i][len(s[i])-1]=='A':
    ca+=1
  ans+=s[i].count('AB')
if cba>0:
  ans+=cba-1
  if cb>0 and ca>0:
    ans+=2+min(cb-1,ca-1)
  else:
    ans+=1
else:
  ans+=min(cb,ca)
print(ans)