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

ans = 0

ab_cnt = 0
tail_a_cnt = 0
head_b_cnt = 0

N.times do |i|
  s = gets.chomp

  ans += s.scan('AB').length

  if s[0] == 'B' && s[-1] == 'A'
    ab_cnt += 1
  elsif s[0] == 'B'
    head_b_cnt += 1
  elsif s[-1] == 'A'
    tail_a_cnt += 1
  end
end

# abは足してもabなので残り1つになるまで答えにたす
# p ab_cnt
# p tail_a_cnt
# p head_b_cnt

if ab_cnt > 0
  # 残り1つになるまで足す
  ans += ab_cnt-1

  # aかbがあればそれに置き換えられるので足す
  ans += 1 if tail_a_cnt > 0 || head_b_cnt > 0
end

ans += [head_b_cnt,tail_a_cnt].min

p ans