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.to_i
#S=gets.chomp
#A=(0...N).map{gets.to_i}
#sum=A.inject(&:+)
#B=gets.split.map(&:to_i)
N=gets.to_i
 
 
S=(0...N).map{gets.chomp}
 
internalAB=0
endwithA=0
startwithB=0
startwithBendwithA=0
 
S.each do |s|
  if s[0]=='B'
    if s[-1]=='A'
      startwithBendwithA+=1
    else
      startwithB+=1
    end
  elsif s[-1]=='A'
    endwithA+=1
  end
  lastisA=false
  s.each_char do |c|
    if c=='A'
      lastisA=true
      next
    elsif lastisA && c=='B'
      internalAB+=1
    end
    lastisA=false
  end
end

if startwithBendwithA>=1 && startwithB==0 && endwithA==0
  catAB=startwithBendwithA-1
else
  catAB=startwithBendwithA+[startwithB,endwithA].min
end

puts catAB+internalAB