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
ary = []
n.times do
    ary << gets.chomp
end

ab_count = 0
a_count = 0
b_count = 0
ba_count = 0
ary.each do |str|
    # 文字列に含まれるABの数をcountします
    for i in 0..(str.length-1)
        if str[i] == "A"
            if str[i+1] == "B"
                ab_count += 1
            end
        end
    end
    if str[-1] == "A" and str[0] == "B"
        ba_count += 1 
    elsif str[-1] == "A"
        a_count += 1
    elsif str[0] == "B"
        b_count += 1
    end
end
# p [ab_count,a_count, b_count]
if a_count != 0 and ba_count != 0
    b_count_flag = true
end
if b_count != 0 and ba_count != 0
    a_count += 1
end
if b_count_flag
    b_count += 1
end
min = [a_count, b_count].min
# min -= 1 if min == n
if ba_count == 0
    ans = ab_count + min
else
    ans = ab_count + min + ba_count -1 
end
puts(ans)