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())
s = [input() for i in range(N)]

ans = 0
n_a = 0
n_b = 0
n_ab = 0
A_count = 0
B_count = 0
for i in range(N):
	ans += s[i].count("AB")
	if s[i][0] == "B" and s[i][-1] == "A":
		n_ab += 1
	if s[i][0] == "B" and s[i][-1] != "A":
		n_b += 1
	if s[i][0] != "B" and s[i][-1] == "A":
		n_a += 1
if n_ab == 0:
	ans += min(n_a,n_b)
if n_ab != 0:
	ans += n_ab-1
	if n_a == 0 and n_b == 0:
		ans += 0
	if n_a == 0 and n_b != 0:
		ans += 1
	if n_a != 0 and n_b == 0:
		ans += 1
	if n_a != 0 and n_b != 0:
		ans += 2+min(n_a-1,n_b-1)

print(ans)