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.chomp.to_i
b_a = 0
b_x = 0
x_a = 0
default = 0
n.times do |i|
  str = gets.chomp
  if (str[0] == 'B' && str[-1] == 'A')
    b_a += 1
  elsif(str[0] == 'B')
    b_x += 1
  elsif(str[-1] == 'A')
    x_a += 1
  end
  default += str.scan('AB').length
end
hoge = [b_x,x_a].min
fuga = [b_x,x_a].max

if ((fuga-hoge) >= b_a)
  puts default + hoge + b_a
else
  puts default + hoge + (fuga-hoge) + (b_a / 2)
end