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)

N = int(input())
s = []
s_cnt = 0
for a in range(N):
  s_str = input()
  s.append(s_str)
for i in range(0,N):
  s_cnt_i = s[i].count("AB")
  s_cnt += s_cnt_i
  i_val = list(set(list(s[i])))
  i_val_cnt_b = 0
  i_val_cnt_a = 0
  if i_val[0] == "b":
    i_val_cnt_b += 1
  if i_val[-1] == "a":
    i_val_cnt_a += 1
if i_val_cnt_a >= i_val_cnt_b:
  print(i_val_cnt_a + s_cnt)
else:
  print(i_val_cnt_b + s_cnt)