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.to_i
xa = 0
bx = 0
ba = 0
fixed = 0
n.times do |i|
  s = gets.strip
  bx += 1 if s[0] == 'B' && s[-1] != 'A'
  xa += 1 if s[-1] == 'A' && s[0] != 'B'
  ba += 1 if s[0] == 'B' && s[-1] == 'A'
  for i in 0...s.length - 1
    break if i == s.length - 1
    fixed += 1 if s[i] == 'A' && s[i + 1] == 'B'
  end
end
#puts "bx: #{bx}, xa: #{xa}, ba: #{ba}, fixed: #{fixed}"
p0 = [xa, bx].min
xdiff = (xa - bx).abs
p1 = [ba - p0, ba].max
abdiff = p1 - ba
p2 = [abdiff, xdiff].min
puts fixed + p0 + p1 + p2