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: Runtime Error)

n = gets.to_i
s = []
b_head_num = 0
a_tail_num = 0
ab_num = 0

def get_ab_num(s)
    count = 0
    (0..(s.length - 2)).each do |i|
        count += 1 if s[i] == 'A' and s[i+1] == 'B'
    end
    count
end

(0...n).each do |i|
    input = gets.strip
    b_head_num += 1 if input[0] == 'B'
    a_tail_num += 1 if input[-1] == 'A'
    ab_num += get_ab_num(input)
    s.append input
end
print ab_num + [n - 1, b_head_num, a_tail_num].min