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 sys import stdin
import numpy as np
 
N = int(input())
S = [input() for _ in range(N)]

cnt_innerAB = 0
cnt_endA = 0
cnt_firstB = 0

for i in range(N):
  cnt_innerAB += S[i].count('AB')
  if S[i][0] == 'B':
    cnt_firstB += 1
  if S[i][-1] == 'A':
    cnt_endA += 1

cnt_sideAB = min(cnt_endA, cnt_firstB, N-1)
ans = cnt_innerAB + cnt_sideAB

print(ans)