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 = readline.to_i
last_a = 0
first_b = 0
la_fb = 0
count = 0
N.times do
  s = readline.chomp
  first_b += 1 if s[0] == 'B'
  last_a += 1 if s[-1] == 'A'
  la_fb += 1 if s[-1] == 'A' and s[0] == 'B'
  s.each_char.with_index do |c,i|
    count += 1 if c == 'A' and s[i+1] == 'B'
  end
end

n = [last_a,first_b].min
n -= 1 if last_a == la_fb and first_b == la_fb
n = 0 if n < 0
# p count, first_b, last_a, n
puts count + n