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: Accepted)

n = gets.chomp.to_i
a = Array.new(n)
cnt = 0
a_hi = 0
b_hi = 0
ab_hi = 0
n.times {|i|
  a[i] = gets.chomp
  a[i].each_char.with_index do |a_char,k|
    if a_char == 'A' and a[i][k+1] == 'B'
      cnt += 1
    end
  end
  if a[i][0] == 'B' and a[i][-1] == 'A'
    ab_hi += 1
  elsif a[i][0] == 'B'
    b_hi += 1
  elsif a[i][-1] == 'A'
    a_hi += 1
  end
}
if ab_hi == 0 
  puts cnt + [a_hi,b_hi].min
else
  if a_hi + b_hi == 0
    puts ab_hi - 1 + cnt
  else
    puts cnt + ab_hi + [a_hi,b_hi].min
  end
end