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)

N = gets.chomp.to_i
s = []
ab = 0
a = 0
b = 0
ba = 0

i = 0
while i < N
  s = gets.chomp
  if s[0] == "B"
    if s[s.size-1] == "A"
      ba += 1
    else
      b += 1
    end
  elsif s[s.size-1] == "A"
    a += 1
  end
  for x in 0...s.size-1
    if s[x] == "A"
      if s[x+1] == "B"
        ab += 1
      end
    end
  end
  i += 1
end

aorb = 0
if a < b
  aorb = a
else
  aorb = b
end
if a==0 && b==0
  ba -= 1
end

answer = ab + ba + aorb

puts answer