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 Ruby (2.3.3) (judge verdict: Wrong Answer)

words=[]
gets.chomp.to_i.times do
  words << gets.chomp
end

count = 0
aend = 0
bstart = 0
for i in 0..(words.count - 1) do
  alph = words[i].split("")
  if alph[0] == "B"
    bstart +=1
  end
  if alph[-1] == "A"
    aend +=1
  end
  for j in 0..(alph.count - 2) do
    if alph[j] == "A" && alph[j + 1] == "B"
      count += 1
    end
  end
end

if aend >= bstart
  count += bstart
else
  count += aend
end

puts count